Base | Representation |
---|---|
bin | 111111010011101… |
… | …1000101101100011 |
3 | 12111001011021201222 |
4 | 1332213120231203 |
5 | 13322302112201 |
6 | 550442045255 |
7 | 103432601333 |
oct | 17647305543 |
9 | 5431137658 |
10 | 2124254051 |
11 | 9a00a4567 |
12 | 4b34a982b |
13 | 27b13067a |
14 | 1621a10c3 |
15 | c675891b |
hex | 7e9d8b63 |
2124254051 has 4 divisors (see below), whose sum is σ = 2173655352. Its totient is φ = 2074852752.
The previous prime is 2124254029. The next prime is 2124254081. The reversal of 2124254051 is 1504524212.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 2124254051 - 214 = 2124237667 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 2124254051.
It is not an unprimeable number, because it can be changed into a prime (2124254081) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 24700586 + ... + 24700671.
It is an arithmetic number, because the mean of its divisors is an integer number (543413838).
Almost surely, 22124254051 is an apocalyptic number.
2124254051 is a deficient number, since it is larger than the sum of its proper divisors (49401301).
2124254051 is an equidigital number, since it uses as much as digits as its factorization.
2124254051 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 49401300.
The product of its (nonzero) digits is 3200, while the sum is 26.
The square root of 2124254051 is about 46089.6306233843. The cubic root of 2124254051 is about 1285.4903428265.
Adding to 2124254051 its reverse (1504524212), we get a palindrome (3628778263).
The spelling of 2124254051 in words is "two billion, one hundred twenty-four million, two hundred fifty-four thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •