Base | Representation |
---|---|
bin | 1010000110001011001110… |
… | …1011011011101011111010 |
3 | 1110022021011102010101200110 |
4 | 2201202303223123223322 |
5 | 2423340234230000442 |
6 | 35335454145045150 |
7 | 2224015222040064 |
oct | 241426353335372 |
9 | 43267142111613 |
10 | 11101210000122 |
11 | 359aaa6701010 |
12 | 12b35a49267b6 |
13 | 626abb8198a8 |
14 | 2a54311aa734 |
15 | 143b7bc5769c |
hex | a18b3adbafa |
11101210000122 has 64 divisors (see below), whose sum is σ = 24880733566848. Its totient is φ = 3272387328000.
The previous prime is 11101210000007. The next prime is 11101210000141. The reversal of 11101210000122 is 22100001210111.
It is a junction number, because it is equal to n+sod(n) for n = 11101210000098 and 11101210000107.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 11047222 + ... + 12010142.
It is an arithmetic number, because the mean of its divisors is an integer number (388761461982).
Almost surely, 211101210000122 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 11101210000122, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (12440366783424).
11101210000122 is an abundant number, since it is smaller than the sum of its proper divisors (13779523566726).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11101210000122 is a wasteful number, since it uses less digits than its factorization.
11101210000122 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 967695.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 11101210000122 its reverse (22100001210111), we get a palindrome (33201211210233).
The spelling of 11101210000122 in words is "eleven trillion, one hundred one billion, two hundred ten million, one hundred twenty-two", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •