Base | Representation |
---|---|
bin | 10110111111100000010111… |
… | …010111101110000100100100 |
3 | 111021001002020110201121100120 |
4 | 112333200113113232010210 |
5 | 101223232004120023022 |
6 | 555022220515441540 |
7 | 30204521114641314 |
oct | 2677402727560444 |
9 | 437032213647316 |
10 | 101121102111012 |
11 | 2a247244a13535 |
12 | b411b445b62b0 |
13 | 44568a9a38629 |
14 | 1ad8404acd444 |
15 | ba55d2b3cd5c |
hex | 5bf8175ee124 |
101121102111012 has 24 divisors (see below), whose sum is σ = 235984565476800. Its totient is φ = 33701987291616.
The previous prime is 101121102110923. The next prime is 101121102111079. The reversal of 101121102111012 is 210111201121101.
It is a junction number, because it is equal to n+sod(n) for n = 101121102110982 and 101121102111000.
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, 630759687 + ... + 630919982.
It is an arithmetic number, because the mean of its divisors is an integer number (9832690228200).
Almost surely, 2101121102111012 is an apocalyptic number.
101121102111012 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
101121102111012 is an abundant number, since it is smaller than the sum of its proper divisors (134863463365788).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101121102111012 is a wasteful number, since it uses less digits than its factorization.
101121102111012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1261686355 (or 1261686353 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 15.
Adding to 101121102111012 its reverse (210111201121101), we get a palindrome (311232303232113).
The spelling of 101121102111012 in words is "one hundred one trillion, one hundred twenty-one billion, one hundred two million, one hundred eleven thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •