Base | Representation |
---|---|
bin | 111101000011010100… |
… | …101011000001101101 |
3 | 20021012120102100020002 |
4 | 331003110223001231 |
5 | 2033223311031104 |
6 | 50040505434045 |
7 | 4510326552305 |
oct | 750324530155 |
9 | 207176370202 |
10 | 65554002029 |
11 | 2588a585a8a |
12 | 10855a9b925 |
13 | 62492caa19 |
14 | 325c366605 |
15 | 1a8a13d01e |
hex | f4352b06d |
65554002029 has 2 divisors, whose sum is σ = 65554002030. Its totient is φ = 65554002028.
The previous prime is 65554002001. The next prime is 65554002061. The reversal of 65554002029 is 92020045556.
65554002029 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 51817693225 + 13736308804 = 227635^2 + 117202^2 .
It is a cyclic number.
It is not a de Polignac number, because 65554002029 - 224 = 65537224813 is a prime.
It is a super-2 number, since 2×655540020292 (a number of 22 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 65554001983 and 65554002001.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (65554008029) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 32777001014 + 32777001015.
It is an arithmetic number, because the mean of its divisors is an integer number (32777001015).
Almost surely, 265554002029 is an apocalyptic number.
It is an amenable number.
65554002029 is a deficient number, since it is larger than the sum of its proper divisors (1).
65554002029 is an equidigital number, since it uses as much as digits as its factorization.
65554002029 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 108000, while the sum is 38.
The spelling of 65554002029 in words is "sixty-five billion, five hundred fifty-four million, two thousand, twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •