Base | Representation |
---|---|
bin | 1001001101001011011000… |
… | …1110100001110010100110 |
3 | 1022211122122121011010010210 |
4 | 2103102312032201302212 |
5 | 2311314324023223420 |
6 | 33305552133000250 |
7 | 2063201413131054 |
oct | 223226616416246 |
9 | 38748577133123 |
10 | 10122000211110 |
11 | 325279726a377 |
12 | 1175865483086 |
13 | 585667862058 |
14 | 26dc9bd871d4 |
15 | 12846a7ed9e0 |
hex | 934b63a1ca6 |
10122000211110 has 32 divisors (see below), whose sum is σ = 24345496419552. Its totient is φ = 2693344954880.
The previous prime is 10122000211109. The next prime is 10122000211111. The reversal of 10122000211110 is 1111200022101.
It is an interprime number because it is at equal distance from previous prime (10122000211109) and next prime (10122000211111).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10122000211111) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 365929779 + ... + 365957438.
It is an arithmetic number, because the mean of its divisors is an integer number (760796763111).
Almost surely, 210122000211110 is an apocalyptic number.
10122000211110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
10122000211110 is an abundant number, since it is smaller than the sum of its proper divisors (14223496208442).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10122000211110 is a wasteful number, since it uses less digits than its factorization.
10122000211110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 731887688.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 10122000211110 its reverse (1111200022101), we get a palindrome (11233200233211).
The spelling of 10122000211110 in words is "ten trillion, one hundred twenty-two billion, two hundred eleven thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.447 sec. • engine limits •