Base | Representation |
---|---|
bin | 10000010101000010011… |
… | …000100110100101011010 |
3 | 10222021100002111202111102 |
4 | 100111002120212211122 |
5 | 121341030123210020 |
6 | 2215252525431402 |
7 | 144032455261463 |
oct | 20250230464532 |
9 | 3867302452442 |
10 | 1122100210010 |
11 | 3a297535196a |
12 | 16157910b562 |
13 | 81a76615510 |
14 | 3c44a691d6a |
15 | 1e2c5cc6475 |
hex | 1054262695a |
1122100210010 has 256 divisors, whose sum is σ = 2441993702400. Its totient is φ = 367408742400.
The previous prime is 1122100209983. The next prime is 1122100210013. The reversal of 1122100210010 is 100120012211.
It is a super-2 number, since 2×11221002100102 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1122100209973 and 1122100210000.
It is not an unprimeable number, because it can be changed into a prime (1122100210013) by changing a digit.
It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 310227722 + ... + 310231338.
It is an arithmetic number, because the mean of its divisors is an integer number (9539037900).
Almost surely, 21122100210010 is an apocalyptic number.
1122100210010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1122100210010 is an abundant number, since it is smaller than the sum of its proper divisors (1319893492390).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1122100210010 is a wasteful number, since it uses less digits than its factorization.
1122100210010 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3817.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 1122100210010 its reverse (100120012211), we get a palindrome (1222220222221).
The spelling of 1122100210010 in words is "one trillion, one hundred twenty-two billion, one hundred million, two hundred ten thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •