Base | Representation |
---|---|
bin | 101111011111111001… |
… | …1001000011110010001 |
3 | 100202021200221120021202 |
4 | 1132333303020132101 |
5 | 3132400014200423 |
6 | 114505323000545 |
7 | 10240464355034 |
oct | 1367763103621 |
9 | 322250846252 |
10 | 102002100113 |
11 | 3a2935875a1 |
12 | 17928369155 |
13 | 9807540974 |
14 | 4d18d0501b |
15 | 29bedb4728 |
hex | 17bfcc8791 |
102002100113 has 8 divisors (see below), whose sum is σ = 105823514880. Its totient is φ = 98200958800.
The previous prime is 102002100049. The next prime is 102002100121. The reversal of 102002100113 is 311001200201.
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 102002100113 - 26 = 102002100049 is a prime.
It is a super-3 number, since 3×1020021001133 (a number of 34 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 102002100094 and 102002100103.
It is not an unprimeable number, because it can be changed into a prime (102002100313) 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, 5058113 + ... + 5078238.
It is an arithmetic number, because the mean of its divisors is an integer number (13227939360).
Almost surely, 2102002100113 is an apocalyptic number.
It is an amenable number.
102002100113 is a deficient number, since it is larger than the sum of its proper divisors (3821414767).
102002100113 is a wasteful number, since it uses less digits than its factorization.
102002100113 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10136727.
The product of its (nonzero) digits is 12, while the sum is 11.
Adding to 102002100113 its reverse (311001200201), we get a palindrome (413003300314).
The spelling of 102002100113 in words is "one hundred two billion, two million, one hundred thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •