Base | Representation |
---|---|
bin | 1001100011100010010011… |
… | …1111011000001101001010 |
3 | 1101012101002220121121102210 |
4 | 2120320210333120031022 |
5 | 2334113003303200020 |
6 | 34202235055405550 |
7 | 2133020133433224 |
oct | 230704477301512 |
9 | 41171086547383 |
10 | 10506110600010 |
11 | 33906865a3773 |
12 | 12181a32238b6 |
13 | 5b295025753c |
14 | 2846d9b11414 |
15 | 13344c2593e0 |
hex | 98e24fd834a |
10506110600010 has 32 divisors (see below), whose sum is σ = 25219051776000. Its totient is φ = 2801142122688.
The previous prime is 10506110599973. The next prime is 10506110600023. The reversal of 10506110600010 is 1000601160501.
It is a super-2 number, since 2×105061106000102 (a number of 27 digits) contains 22 as substring.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 10506110600010.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 30285322 + ... + 30630261.
It is an arithmetic number, because the mean of its divisors is an integer number (788095368000).
Almost surely, 210506110600010 is an apocalyptic number.
10506110600010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
10506110600010 is an abundant number, since it is smaller than the sum of its proper divisors (14712941175990).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10506110600010 is a wasteful number, since it uses less digits than its factorization.
10506110600010 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 60921342.
The product of its (nonzero) digits is 180, while the sum is 21.
Adding to 10506110600010 its reverse (1000601160501), we get a palindrome (11506711760511).
The spelling of 10506110600010 in words is "ten trillion, five hundred six billion, one hundred ten million, six hundred thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •