Base | Representation |
---|---|
bin | 1001000110011011011110… |
… | …1101111100000101100111 |
3 | 1022102120101121021022111200 |
4 | 2101212313231330011213 |
5 | 2302414403120334021 |
6 | 33140415423333543 |
7 | 2051625344032662 |
oct | 221466755740547 |
9 | 38376347238450 |
10 | 10006061105511 |
11 | 3208601700329 |
12 | 11572a97512b3 |
13 | 57774ba9a4a3 |
14 | 2684200c66d9 |
15 | 1254320eb126 |
hex | 919b7b7c167 |
10006061105511 has 12 divisors (see below), whose sum is σ = 14789320290888. Its totient is φ = 6515574673104.
The previous prime is 10006061105507. The next prime is 10006061105603. The reversal of 10006061105511 is 11550116060001.
10006061105511 is a `hidden beast` number, since 1 + 0 + 0 + 0 + 606 + 1 + 1 + 0 + 5 + 51 + 1 = 666.
It is not a de Polignac number, because 10006061105511 - 22 = 10006061105507 is a prime.
It is a super-2 number, since 2×100060611055112 (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 (10006061106511) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 12927727140 + ... + 12927727913.
It is an arithmetic number, because the mean of its divisors is an integer number (1232443357574).
Almost surely, 210006061105511 is an apocalyptic number.
10006061105511 is a deficient number, since it is larger than the sum of its proper divisors (4783259185377).
10006061105511 is a wasteful number, since it uses less digits than its factorization.
10006061105511 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 25855455102 (or 25855455099 counting only the distinct ones).
The product of its (nonzero) digits is 900, while the sum is 27.
Adding to 10006061105511 its reverse (11550116060001), we get a palindrome (21556177165512).
The spelling of 10006061105511 in words is "ten trillion, six billion, sixty-one million, one hundred five thousand, five hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •