Base | Representation |
---|---|
bin | 11101000110101010101… |
… | …00000100010010011010 |
3 | 10112121012111112110121010 |
4 | 32203111110010102122 |
5 | 112341010333020442 |
6 | 2043222050554350 |
7 | 132151132056525 |
oct | 16432524042232 |
9 | 3477174473533 |
10 | 1000011220122 |
11 | 356114299822 |
12 | 1419858989b6 |
13 | 733ba6c6875 |
14 | 36587b27bbc |
15 | 1b02c730b9c |
hex | e8d550449a |
1000011220122 has 8 divisors (see below), whose sum is σ = 2000022440256. Its totient is φ = 333337073372.
The previous prime is 1000011220111. The next prime is 1000011220163. The reversal of 1000011220122 is 2210221100001.
It is a sphenic number, since it is the product of 3 distinct primes.
1000011220122 is an admirable number.
It is a super-2 number, since 2×10000112201222 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1000011220098 and 1000011220107.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 83334268338 + ... + 83334268349.
It is an arithmetic number, because the mean of its divisors is an integer number (250002805032).
Almost surely, 21000011220122 is an apocalyptic number.
1000011220122 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1000011220122 is a wasteful number, since it uses less digits than its factorization.
1000011220122 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 166668536692.
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 1000011220122 its reverse (2210221100001), we get a palindrome (3210232320123).
The spelling of 1000011220122 in words is "one trillion, eleven million, two hundred twenty thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •