Base | Representation |
---|---|
bin | 111011111110011… |
… | …0110011101101101 |
3 | 12012020202120021201 |
4 | 1313330312131231 |
5 | 13110141043204 |
6 | 531405325501 |
7 | 100604314156 |
oct | 16774663555 |
9 | 5166676251 |
10 | 2012440429 |
11 | 942a7430a |
12 | 481b66891 |
13 | 260c1196c |
14 | 1513b692d |
15 | bba1d9a4 |
hex | 77f3676d |
2012440429 has 2 divisors, whose sum is σ = 2012440430. Its totient is φ = 2012440428.
The previous prime is 2012440427. The next prime is 2012440457. The reversal of 2012440429 is 9240442102.
It is an a-pointer prime, because the next prime (2012440457) can be obtained adding 2012440429 to its sum of digits (28).
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 2007219204 + 5221225 = 44802^2 + 2285^2 .
It is a cyclic number.
It is not a de Polignac number, because 2012440429 - 21 = 2012440427 is a prime.
Together with 2012440427, it forms a pair of twin primes.
It is a junction number, because it is equal to n+sod(n) for n = 2012440397 and 2012440406.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2012440427) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1006220214 + 1006220215.
It is an arithmetic number, because the mean of its divisors is an integer number (1006220215).
Almost surely, 22012440429 is an apocalyptic number.
It is an amenable number.
2012440429 is a deficient number, since it is larger than the sum of its proper divisors (1).
2012440429 is an equidigital number, since it uses as much as digits as its factorization.
2012440429 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 4608, while the sum is 28.
The square root of 2012440429 is about 44860.2321549945. The cubic root of 2012440429 is about 1262.5279785193.
The spelling of 2012440429 in words is "two billion, twelve million, four hundred forty thousand, four hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •