Base | Representation |
---|---|
bin | 1001100110011100001011… |
… | …1111101001001100100011 |
3 | 1101101010220012211010200210 |
4 | 2121213002333221030203 |
5 | 2340422200031004422 |
6 | 34241210125345203 |
7 | 2136434446323312 |
oct | 231470277511443 |
9 | 41333805733623 |
10 | 10556006109987 |
11 | 33aa860288928 |
12 | 12259a9108203 |
13 | 5b7572470b40 |
14 | 286cb0602279 |
15 | 1348bc85e10c |
hex | 999c2fe9323 |
10556006109987 has 16 divisors (see below), whose sum is σ = 15225312263168. Its totient is φ = 6466873692960.
The previous prime is 10556006109941. The next prime is 10556006110033. The reversal of 10556006109987 is 78990160065501.
It is an interprime number because it is at equal distance from previous prime (10556006109941) and next prime (10556006110033).
It is not a de Polignac number, because 10556006109987 - 212 = 10556006105891 is a prime.
It is a super-2 number, since 2×105560061099872 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10556006105987) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 606867589 + ... + 606884982.
It is an arithmetic number, because the mean of its divisors is an integer number (951582016448).
Almost surely, 210556006109987 is an apocalyptic number.
10556006109987 is a deficient number, since it is larger than the sum of its proper divisors (4669306153181).
10556006109987 is a wasteful number, since it uses less digits than its factorization.
10556006109987 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1213752810.
The product of its (nonzero) digits is 4082400, while the sum is 57.
The spelling of 10556006109987 in words is "ten trillion, five hundred fifty-six billion, six million, one hundred nine thousand, nine hundred eighty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •