Base | Representation |
---|---|
bin | 10110101111101001001110… |
… | …111110000010100101110101 |
3 | 111010011212210021022101000022 |
4 | 112233221032332002211311 |
5 | 101102402204440211404 |
6 | 552425354202454525 |
7 | 30033003144104045 |
oct | 2657511676024565 |
9 | 433155707271008 |
10 | 100031113210229 |
11 | 29966a58668563 |
12 | b276849504445 |
13 | 43a7b80035806 |
14 | 1a9b763037725 |
15 | b8708aedd8be |
hex | 5afa4ef82975 |
100031113210229 has 16 divisors (see below), whose sum is σ = 102074640138240. Its totient is φ = 98009703140400.
The previous prime is 100031113210199. The next prime is 100031113210331. The reversal of 100031113210229 is 922012311130001.
It is a cyclic number.
It is not a de Polignac number, because 100031113210229 - 240 = 98931601582453 is a prime.
It is a super-2 number, since 2×1000311132102292 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 100031113210198 and 100031113210207.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100031112210229) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1033052 + ... + 14182010.
It is an arithmetic number, because the mean of its divisors is an integer number (6379665008640).
Almost surely, 2100031113210229 is an apocalyptic number.
It is an amenable number.
100031113210229 is a deficient number, since it is larger than the sum of its proper divisors (2043526928011).
100031113210229 is a wasteful number, since it uses less digits than its factorization.
100031113210229 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13149800.
The product of its (nonzero) digits is 648, while the sum is 26.
The spelling of 100031113210229 in words is "one hundred trillion, thirty-one billion, one hundred thirteen million, two hundred ten thousand, two hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •