Base | Representation |
---|---|
bin | 10110110000111100111101… |
… | …111001000101010100001100 |
3 | 111010111110212002200212212020 |
4 | 112300330331321011110030 |
5 | 101110340322334324322 |
6 | 552534543451010140 |
7 | 30042335143565565 |
oct | 2660747571052414 |
9 | 433443762625766 |
10 | 100121021011212 |
11 | 299a10a5236113 |
12 | b29015b439950 |
13 | 43b34aaa15c56 |
14 | 1aa1c519b516c |
15 | b8959e20705c |
hex | 5b0f3de4550c |
100121021011212 has 24 divisors (see below), whose sum is σ = 233624262228336. Its totient is φ = 33372452736768.
The previous prime is 100121021011199. The next prime is 100121021011243. The reversal of 100121021011212 is 212110120121001.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 100121021011191 and 100121021011200.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 152274993 + ... + 152931080.
It is an arithmetic number, because the mean of its divisors is an integer number (9734344259514).
Almost surely, 2100121021011212 is an apocalyptic number.
100121021011212 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
100121021011212 is an abundant number, since it is smaller than the sum of its proper divisors (133503241217124).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
100121021011212 is a wasteful number, since it uses less digits than its factorization.
100121021011212 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 305233417 (or 305233415 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 100121021011212 its reverse (212110120121001), we get a palindrome (312231141132213).
The spelling of 100121021011212 in words is "one hundred trillion, one hundred twenty-one billion, twenty-one million, eleven thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •