Base | Representation |
---|---|
bin | 10110110000101011010000… |
… | …001010001001100100000000 |
3 | 111010102122202111112121021011 |
4 | 112300223100022021210000 |
5 | 101110032344012401422 |
6 | 552522120215210304 |
7 | 30041062610651452 |
oct | 2660532012114400 |
9 | 433378674477234 |
10 | 100102000122112 |
11 | 2999402446265a |
12 | b288531376994 |
13 | 43b17691434a1 |
14 | 1aa0d697602d2 |
15 | b88d393e3077 |
hex | 5b0ad0289900 |
100102000122112 has 18 divisors (see below), whose sum is σ = 199812976806758. Its totient is φ = 50051000060928.
The previous prime is 100102000122067. The next prime is 100102000122119. The reversal of 100102000122112 is 211221000201001.
It can be written as a sum of positive squares in only one way, i.e., 87558389565696 + 12543610556416 = 9357264^2 + 3541696^2 .
It is a super-2 number, since 2×1001020001221122 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 100102000122092 and 100102000122101.
It is not an unprimeable number, because it can be changed into a prime (100102000122119) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 195511718733 + ... + 195511719244.
Almost surely, 2100102000122112 is an apocalyptic number.
It is an amenable number.
100102000122112 is a deficient number, since it is larger than the sum of its proper divisors (99710976684646).
100102000122112 is an frugal number, since it uses more digits than its factorization.
100102000122112 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 391023437993 (or 391023437979 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 100102000122112 its reverse (211221000201001), we get a palindrome (311323000323113).
The spelling of 100102000122112 in words is "one hundred trillion, one hundred two billion, one hundred twenty-two thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •