Base | Representation |
---|---|
bin | 10110110000111101000011… |
… | …110011000101011010000100 |
3 | 111010111111010000011012220011 |
4 | 112300331003303011122010 |
5 | 101110341023221231040 |
6 | 552535001350520004 |
7 | 30042340456053223 |
oct | 2660750363053204 |
9 | 433444100135804 |
10 | 100121120102020 |
11 | 299a1146166546 |
12 | b290188666004 |
13 | 43b34c53cb974 |
14 | 1aa1c60c0acba |
15 | b895a7c7c3ea |
hex | 5b0f43cc5684 |
100121120102020 has 48 divisors (see below), whose sum is σ = 222623079896448. Its totient is φ = 37692517363200.
The previous prime is 100121120101999. The next prime is 100121120102039. The reversal of 100121120102020 is 20201021121001.
It is a super-2 number, since 2×1001211201020202 (a number of 29 digits) contains 22 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 166623439 + ... + 167223241.
It is an arithmetic number, because the mean of its divisors is an integer number (4637980831176).
Almost surely, 2100121120102020 is an apocalyptic number.
100121120102020 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
100121120102020 is an abundant number, since it is smaller than the sum of its proper divisors (122501959794428).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
100121120102020 is a wasteful number, since it uses less digits than its factorization.
100121120102020 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1090780 (or 1090778 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 100121120102020 its reverse (20201021121001), we get a palindrome (120322141223021).
The spelling of 100121120102020 in words is "one hundred trillion, one hundred twenty-one billion, one hundred twenty million, one hundred two thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.129 sec. • engine limits •