Base | Representation |
---|---|
bin | 10110110011101110001000… |
… | …000100001111101001011010 |
3 | 111011011122212001211112222020 |
4 | 112303232020010033221122 |
5 | 101121444411431341442 |
6 | 553202203242035310 |
7 | 30062151065453223 |
oct | 2663561004175132 |
9 | 434148761745866 |
10 | 100311244012122 |
11 | 29a6483a155180 |
12 | b300ba87a8b36 |
13 | 43c84045c6260 |
14 | 1aab1393c224a |
15 | b8e4d416c9ec |
hex | 5b3b8810fa5a |
100311244012122 has 32 divisors (see below), whose sum is σ = 235696349568960. Its totient is φ = 28059089233920.
The previous prime is 100311244012069. The next prime is 100311244012123. The reversal of 100311244012122 is 221210442113001.
It is a junction number, because it is equal to n+sod(n) for n = 100311244012092 and 100311244012101.
It is not an unprimeable number, because it can be changed into a prime (100311244012123) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 58456435047 + ... + 58456436762.
It is an arithmetic number, because the mean of its divisors is an integer number (7365510924030).
Almost surely, 2100311244012122 is an apocalyptic number.
100311244012122 is an abundant number, since it is smaller than the sum of its proper divisors (135385105556838).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
100311244012122 is a wasteful number, since it uses less digits than its factorization.
100311244012122 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 116912871838.
The product of its (nonzero) digits is 768, while the sum is 24.
Adding to 100311244012122 its reverse (221210442113001), we get a palindrome (321521686125123).
The spelling of 100311244012122 in words is "one hundred trillion, three hundred eleven billion, two hundred forty-four million, twelve thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.122 sec. • engine limits •