Base | Representation |
---|---|
bin | 10000010100111100011… |
… | …010101101111010010010 |
3 | 10222021002010010200202200 |
4 | 100110330122231322102 |
5 | 121340324011213020 |
6 | 2215234552024030 |
7 | 144030131333505 |
oct | 20247432557222 |
9 | 3867063120680 |
10 | 1122000101010 |
11 | 3a2923896558 |
12 | 16154b692016 |
13 | 81a5b964219 |
14 | 3c43b27313c |
15 | 1e2bc0ee590 |
hex | 1053c6ade92 |
1122000101010 has 24 divisors (see below), whose sum is σ = 2917200262860. Its totient is φ = 299200026912.
The previous prime is 1122000100987. The next prime is 1122000101023. The reversal of 1122000101010 is 101010002211.
It is a happy number.
It can be written as a sum of positive squares in 2 ways, for example, as 1038142945449 + 83857155561 = 1018893^2 + 289581^2 .
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a junction number, because it is equal to n+sod(n) for n = 1122000100983 and 1122000101001.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 6233333805 + ... + 6233333984.
Almost surely, 21122000101010 is an apocalyptic number.
1122000101010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1122000101010 is an abundant number, since it is smaller than the sum of its proper divisors (1795200161850).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1122000101010 is a wasteful number, since it uses less digits than its factorization.
1122000101010 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 12466667802 (or 12466667799 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 1122000101010 its reverse (101010002211), we get a palindrome (1223010103221).
The spelling of 1122000101010 in words is "one trillion, one hundred twenty-two billion, one hundred one thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •