Base | Representation |
---|---|
bin | 10110101111001111000101… |
… | …001001101011000101111011 |
3 | 111010002012022012001110010221 |
4 | 112233033011021223011323 |
5 | 101101422201441400443 |
6 | 552404431443520511 |
7 | 30030660224002342 |
oct | 2657170511530573 |
9 | 433065265043127 |
10 | 100003031200123 |
11 | 29956058047747 |
12 | b271310989137 |
13 | 43a532613279c |
14 | 1a9a25b61ab59 |
15 | b86495977eed |
hex | 5af3c526b17b |
100003031200123 has 4 divisors (see below), whose sum is σ = 100003273980280. Its totient is φ = 100002788419968.
The previous prime is 100003031200117. The next prime is 100003031200133. The reversal of 100003031200123 is 321002130300001.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-100003031200123 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 100003031200097 and 100003031200106.
It is not an unprimeable number, because it can be changed into a prime (100003031200133) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 120771165 + ... + 121596382.
It is an arithmetic number, because the mean of its divisors is an integer number (25000818495070).
Almost surely, 2100003031200123 is an apocalyptic number.
100003031200123 is a deficient number, since it is larger than the sum of its proper divisors (242780157).
100003031200123 is an equidigital number, since it uses as much as digits as its factorization.
100003031200123 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 242780156.
The product of its (nonzero) digits is 108, while the sum is 16.
Adding to 100003031200123 its reverse (321002130300001), we get a palindrome (421005161500124).
The spelling of 100003031200123 in words is "one hundred trillion, three billion, thirty-one million, two hundred thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •