Base | Representation |
---|---|
bin | 1001001001010100000100… |
… | …0110010011000101110101 |
3 | 1022121022021210101221111222 |
4 | 2102111001012103011311 |
5 | 2304222342304010122 |
6 | 33215252253240125 |
7 | 2055331255623566 |
oct | 222250106230565 |
9 | 38538253357458 |
10 | 10055610610037 |
11 | 3227619049473 |
12 | 1164a17793045 |
13 | 57c3173c8b35 |
14 | 26a9a0a6a16d |
15 | 126882155b42 |
hex | 92541193175 |
10055610610037 has 2 divisors, whose sum is σ = 10055610610038. Its totient is φ = 10055610610036.
The previous prime is 10055610610013. The next prime is 10055610610103. The reversal of 10055610610037 is 73001601655001.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 6642609310276 + 3413001299761 = 2577326^2 + 1847431^2 .
It is a cyclic number.
It is not a de Polignac number, because 10055610610037 - 212 = 10055610605941 is a prime.
It is a super-2 number, since 2×100556106100372 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 10055610609979 and 10055610610006.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10055610619037) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5027805305018 + 5027805305019.
It is an arithmetic number, because the mean of its divisors is an integer number (5027805305019).
Almost surely, 210055610610037 is an apocalyptic number.
It is an amenable number.
10055610610037 is a deficient number, since it is larger than the sum of its proper divisors (1).
10055610610037 is an equidigital number, since it uses as much as digits as its factorization.
10055610610037 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 18900, while the sum is 35.
The spelling of 10055610610037 in words is "ten trillion, fifty-five billion, six hundred ten million, six hundred ten thousand, thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •