Base | Representation |
---|---|
bin | 1001100001011001… |
… | …1011011100101101 |
3 | 20121010121002101011 |
4 | 2120112123130231 |
5 | 20213320011204 |
6 | 1101344145221 |
7 | 120224531641 |
oct | 23026333455 |
9 | 6533532334 |
10 | 2556016429 |
11 | 10a1893a7a |
12 | 5b4008211 |
13 | 319713175 |
14 | 1a3672c21 |
15 | ee5e3304 |
hex | 9859b72d |
2556016429 has 2 divisors, whose sum is σ = 2556016430. Its totient is φ = 2556016428.
The previous prime is 2556016423. The next prime is 2556016451. The reversal of 2556016429 is 9246106552.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1989338404 + 566678025 = 44602^2 + 23805^2 .
It is a cyclic number.
It is not a de Polignac number, because 2556016429 - 211 = 2556014381 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2556016391 and 2556016400.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2556016423) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1278008214 + 1278008215.
It is an arithmetic number, because the mean of its divisors is an integer number (1278008215).
Almost surely, 22556016429 is an apocalyptic number.
It is an amenable number.
2556016429 is a deficient number, since it is larger than the sum of its proper divisors (1).
2556016429 is an equidigital number, since it uses as much as digits as its factorization.
2556016429 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 129600, while the sum is 40.
The square root of 2556016429 is about 50557.0611190959. The cubic root of 2556016429 is about 1367.2708253731.
The spelling of 2556016429 in words is "two billion, five hundred fifty-six million, sixteen thousand, four hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •