Base | Representation |
---|---|
bin | 1001100110011100001011… |
… | …1111101001011100100101 |
3 | 1101101010220012211012002210 |
4 | 2121213002333221130211 |
5 | 2340422200031023023 |
6 | 34241210125354033 |
7 | 2136434446326306 |
oct | 231470277513445 |
9 | 41333805735083 |
10 | 10556006111013 |
11 | 33aa860289680 |
12 | 12259a9108919 |
13 | 5b757247144c |
14 | 286cb06027ad |
15 | 1348bc85e593 |
hex | 999c2fe9725 |
10556006111013 has 8 divisors (see below), whose sum is σ = 15354190706976. Its totient is φ = 6397579461200.
The previous prime is 10556006111011. The next prime is 10556006111071. The reversal of 10556006111013 is 31011160065501.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 10556006111013 - 21 = 10556006111011 is a prime.
It is a super-2 number, since 2×105560061110132 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10556006111011) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 159939486498 + ... + 159939486563.
It is an arithmetic number, because the mean of its divisors is an integer number (1919273838372).
Almost surely, 210556006111013 is an apocalyptic number.
It is an amenable number.
10556006111013 is a deficient number, since it is larger than the sum of its proper divisors (4798184595963).
10556006111013 is a wasteful number, since it uses less digits than its factorization.
10556006111013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 319878973075.
The product of its (nonzero) digits is 2700, while the sum is 30.
Adding to 10556006111013 its reverse (31011160065501), we get a palindrome (41567166176514).
The spelling of 10556006111013 in words is "ten trillion, five hundred fifty-six billion, six million, one hundred eleven thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.099 sec. • engine limits •