Base | Representation |
---|---|
bin | 1001001101001011011101… |
… | …1010000001000101101110 |
3 | 1022211122200222101111112201 |
4 | 2103102313122001011232 |
5 | 2311314344110000420 |
6 | 33305554121052114 |
7 | 2063202043260664 |
oct | 223226732010556 |
9 | 38748628344481 |
10 | 10122020000110 |
11 | 32527a7456117 |
12 | 117587002703a |
13 | 58566b9a0415 |
14 | 26dca0858c34 |
15 | 12846c40c10a |
hex | 934b768116e |
10122020000110 has 8 divisors (see below), whose sum is σ = 18219636000216. Its totient is φ = 4048808000040.
The previous prime is 10122020000087. The next prime is 10122020000129. The reversal of 10122020000110 is 1100002022101.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a Harshad number since it is a multiple of its sum of digits (10), and also a Moran number because the ratio is a prime number: 1012202000011 = 10122020000110 / (1 + 0 + 1 + 2 + 2 + 0 + 2 + 0 + 0 + 0 + 0 + 1 + 1 + 0).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 506100999996 + ... + 506101000015.
It is an arithmetic number, because the mean of its divisors is an integer number (2277454500027).
Almost surely, 210122020000110 is an apocalyptic number.
10122020000110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
10122020000110 is a deficient number, since it is larger than the sum of its proper divisors (8097616000106).
10122020000110 is a wasteful number, since it uses less digits than its factorization.
10122020000110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1012202000018.
The product of its (nonzero) digits is 8, while the sum is 10.
Adding to 10122020000110 its reverse (1100002022101), we get a palindrome (11222022022211).
The spelling of 10122020000110 in words is "ten trillion, one hundred twenty-two billion, twenty million, one hundred ten", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •