Base | Representation |
---|---|
bin | 1001100110011000011110… |
… | …1011100111101001100111 |
3 | 1101101001022212100120022200 |
4 | 2121212013223213221213 |
5 | 2340413130304130111 |
6 | 34240523301025543 |
7 | 2136401004140553 |
oct | 231460753475147 |
9 | 41331285316280 |
10 | 10555011005031 |
11 | 33aa39a5a8839 |
12 | 122576b9b52b3 |
13 | 5b7444258a3c |
14 | 286c183aa863 |
15 | 1348602e8256 |
hex | 99987ae7a67 |
10555011005031 has 6 divisors (see below), whose sum is σ = 15246127007280. Its totient is φ = 7036674003348.
The previous prime is 10555011005027. The next prime is 10555011005047. The reversal of 10555011005031 is 13050011055501.
10555011005031 is a `hidden beast` number, since 1 + 0 + 5 + 5 + 50 + 1 + 100 + 503 + 1 = 666.
It is not a de Polignac number, because 10555011005031 - 22 = 10555011005027 is a prime.
It is a super-2 number, since 2×105550110050312 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 10555011004986 and 10555011005004.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10555011005051) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 586389500271 + ... + 586389500288.
It is an arithmetic number, because the mean of its divisors is an integer number (2541021167880).
Almost surely, 210555011005031 is an apocalyptic number.
10555011005031 is a deficient number, since it is larger than the sum of its proper divisors (4691116002249).
10555011005031 is a wasteful number, since it uses less digits than its factorization.
10555011005031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1172779000565 (or 1172779000562 counting only the distinct ones).
The product of its (nonzero) digits is 1875, while the sum is 27.
The spelling of 10555011005031 in words is "ten trillion, five hundred fifty-five billion, eleven million, five thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •