Base | Representation |
---|---|
bin | 10000001001110001010… |
… | …001100110100011001010 |
3 | 10221010002221121010020210 |
4 | 100021301101212203022 |
5 | 121141241003031442 |
6 | 2205532231101550 |
7 | 143123612225406 |
oct | 20116121464312 |
9 | 3833087533223 |
10 | 1110002002122 |
11 | 398827213252 |
12 | 15b1615118b6 |
13 | 80899016b20 |
14 | 3ba1d9cc106 |
15 | 1dd18b0719c |
hex | 102714668ca |
1110002002122 has 64 divisors (see below), whose sum is σ = 2499803099136. Its totient is φ = 326023938240.
The previous prime is 1110002002121. The next prime is 1110002002129. The reversal of 1110002002122 is 2212002000111.
It is a junction number, because it is equal to n+sod(n) for n = 1110002002098 and 1110002002107.
It is not an unprimeable number, because it can be changed into a prime (1110002002121) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 250783 + ... + 1510925.
It is an arithmetic number, because the mean of its divisors is an integer number (39059423424).
Almost surely, 21110002002122 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 1110002002122, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1249901549568).
1110002002122 is an abundant number, since it is smaller than the sum of its proper divisors (1389801097014).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1110002002122 is a wasteful number, since it uses less digits than its factorization.
1110002002122 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1260675.
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 1110002002122 its reverse (2212002000111), we get a palindrome (3322004002233).
The spelling of 1110002002122 in words is "one trillion, one hundred ten billion, two million, two thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •