Base | Representation |
---|---|
bin | 1001100011100010010011… |
… | …1111011000001101001011 |
3 | 1101012101002220121121102211 |
4 | 2120320210333120031023 |
5 | 2334113003303200021 |
6 | 34202235055405551 |
7 | 2133020133433225 |
oct | 230704477301513 |
9 | 41171086547384 |
10 | 10506110600011 |
11 | 33906865a3774 |
12 | 12181a32238b7 |
13 | 5b2950257540 |
14 | 2846d9b11415 |
15 | 13344c2593e1 |
hex | 98e24fd834b |
10506110600011 has 32 divisors (see below), whose sum is σ = 12206994891840. Its totient is φ = 8954426118144.
The previous prime is 10506110599973. The next prime is 10506110600023. The reversal of 10506110600011 is 11000601160501.
10506110600011 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 10506110600011 - 219 = 10506110075723 is a prime.
It is a super-2 number, since 2×105061106000112 (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 (10506110600411) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 147185016 + ... + 147256378.
It is an arithmetic number, because the mean of its divisors is an integer number (381468590370).
Almost surely, 210506110600011 is an apocalyptic number.
10506110600011 is a deficient number, since it is larger than the sum of its proper divisors (1700884291829).
10506110600011 is a wasteful number, since it uses less digits than its factorization.
10506110600011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 84015.
The product of its (nonzero) digits is 180, while the sum is 22.
Adding to 10506110600011 its reverse (11000601160501), we get a palindrome (21506711760512).
The spelling of 10506110600011 in words is "ten trillion, five hundred six billion, one hundred ten million, six hundred thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •