Base | Representation |
---|---|
bin | 11101001010010111101… |
… | …11011111111111011010 |
3 | 10112210100010012010122210 |
4 | 32211023313133333122 |
5 | 112404044024020442 |
6 | 2044151302055550 |
7 | 132251333225406 |
oct | 16451367377732 |
9 | 3483303163583 |
10 | 1002000220122 |
11 | 356a45002980 |
12 | 14223ba1a5b6 |
13 | 736467bc145 |
14 | 366d5d5c106 |
15 | 1b0e716e19c |
hex | e94bddffda |
1002000220122 has 64 divisors (see below), whose sum is σ = 2228588619264. Its totient is φ = 297786603840.
The previous prime is 1002000220069. The next prime is 1002000220163. The reversal of 1002000220122 is 2210220002001.
It is a super-2 number, since 2×10020002201222 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1002000220098 and 1002000220107.
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, 504688 + ... + 1502900.
It is an arithmetic number, because the mean of its divisors is an integer number (34821697176).
Almost surely, 21002000220122 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 1002000220122, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1114294309632).
1002000220122 is an abundant number, since it is smaller than the sum of its proper divisors (1226588399142).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1002000220122 is a wasteful number, since it uses less digits than its factorization.
1002000220122 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 998523.
The product of its (nonzero) digits is 32, while the sum is 12.
Adding to 1002000220122 its reverse (2210220002001), we get a palindrome (3212220222123).
The spelling of 1002000220122 in words is "one trillion, two billion, two hundred twenty thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •