Base | Representation |
---|---|
bin | 10110110000110100110000… |
… | …110101011111111001101011 |
3 | 111010110122010012001102122210 |
4 | 112300310300311133321223 |
5 | 101110214302240030011 |
6 | 552530525412020203 |
7 | 30041603640530004 |
oct | 2660646065377153 |
9 | 433418105042583 |
10 | 100112212033131 |
11 | 29998394855541 |
12 | b28a501301663 |
13 | 43b27059c859c |
14 | 1aa1657ac61ab |
15 | b89235bae6a6 |
hex | 5b0d30d5fe6b |
100112212033131 has 32 divisors (see below), whose sum is σ = 135202826764800. Its totient is φ = 65883998695680.
The previous prime is 100112212033121. The next prime is 100112212033139. The reversal of 100112212033131 is 131330212211001.
It is not a de Polignac number, because 100112212033131 - 231 = 100110064549483 is a prime.
It is a super-2 number, since 2×1001122120331312 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 100112212033098 and 100112212033107.
It is not an unprimeable number, because it can be changed into a prime (100112212033139) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 3430953300 + ... + 3430982478.
It is an arithmetic number, because the mean of its divisors is an integer number (4225088336400).
Almost surely, 2100112212033131 is an apocalyptic number.
100112212033131 is a deficient number, since it is larger than the sum of its proper divisors (35090614731669).
100112212033131 is a wasteful number, since it uses less digits than its factorization.
100112212033131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 49779.
The product of its (nonzero) digits is 216, while the sum is 21.
Adding to 100112212033131 its reverse (131330212211001), we get a palindrome (231442424244132).
The spelling of 100112212033131 in words is "one hundred trillion, one hundred twelve billion, two hundred twelve million, thirty-three thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •