Base | Representation |
---|---|
bin | 1001000110000110111101… |
… | …0000101101000110100111 |
3 | 1022102001011120010022120221 |
4 | 2101201233100231012213 |
5 | 2302322111412440421 |
6 | 33134104532305211 |
7 | 2051341651552522 |
oct | 221415720550647 |
9 | 38361146108527 |
10 | 10000550515111 |
11 | 3206234063192 |
12 | 1156210172207 |
13 | 577081219300 |
14 | 26805a2b3bb9 |
15 | 12520d438841 |
hex | 9186f42d1a7 |
10000550515111 has 12 divisors (see below), whose sum is σ = 10883415601200. Its totient is φ = 9184889039040.
The previous prime is 10000550515099. The next prime is 10000550515187. The reversal of 10000550515111 is 11151505500001.
It is not a de Polignac number, because 10000550515111 - 25 = 10000550515079 is a prime.
It is a super-2 number, since 2×100005505151112 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10000550815111) 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, 148646910 + ... + 148714171.
It is an arithmetic number, because the mean of its divisors is an integer number (906951300100).
Almost surely, 210000550515111 is an apocalyptic number.
10000550515111 is a deficient number, since it is larger than the sum of its proper divisors (882865086089).
10000550515111 is a wasteful number, since it uses less digits than its factorization.
10000550515111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 297361306 (or 297361293 counting only the distinct ones).
The product of its (nonzero) digits is 625, while the sum is 25.
The spelling of 10000550515111 in words is "ten trillion, five hundred fifty million, five hundred fifteen thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •