Base | Representation |
---|---|
bin | 10110101111001110011001… |
… | …101100000010111010111001 |
3 | 111010002010102100221220121122 |
4 | 112233032121230002322321 |
5 | 101101414203303404423 |
6 | 552404231234515025 |
7 | 30030633161006603 |
oct | 2657163154027271 |
9 | 433063370856548 |
10 | 100002302013113 |
11 | 29955813482755 |
12 | b271148735a75 |
13 | 43a523b044496 |
14 | 1a9a1cc846173 |
15 | b8645193c8c8 |
hex | 5af399b02eb9 |
100002302013113 has 8 divisors (see below), whose sum is σ = 100016053920000. Its totient is φ = 99988550787888.
The previous prime is 100002302013077. The next prime is 100002302013151. The reversal of 100002302013113 is 311310203200001.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 100002302013113 - 222 = 100002297818809 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 100002302013091 and 100002302013100.
It is not an unprimeable number, because it can be changed into a prime (100002302003113) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 338350883 + ... + 338646311.
It is an arithmetic number, because the mean of its divisors is an integer number (12502006740000).
Almost surely, 2100002302013113 is an apocalyptic number.
It is an amenable number.
100002302013113 is a deficient number, since it is larger than the sum of its proper divisors (13751906887).
100002302013113 is an equidigital number, since it uses as much as digits as its factorization.
100002302013113 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 340831.
The product of its (nonzero) digits is 108, while the sum is 17.
Adding to 100002302013113 its reverse (311310203200001), we get a palindrome (411312505213114).
The spelling of 100002302013113 in words is "one hundred trillion, two billion, three hundred two million, thirteen thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •