Base | Representation |
---|---|
bin | 10111001100011100010011… |
… | …110001100010110011101111 |
3 | 111101012001220021002122101002 |
4 | 113030130103301202303233 |
5 | 101332313141100031111 |
6 | 1000542443141510515 |
7 | 30325662242223344 |
oct | 2714342361426357 |
9 | 441161807078332 |
10 | 102010100002031 |
11 | 2a55a271064a81 |
12 | b5362a811243b |
13 | 44bc68500c180 |
14 | 1b2945ac167cb |
15 | bbd7b431063b |
hex | 5cc713c62cef |
102010100002031 has 16 divisors (see below), whose sum is σ = 110146561025088. Its totient is φ = 93915304416000.
The previous prime is 102010100002009. The next prime is 102010100002049. The reversal of 102010100002031 is 130200001010201.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-102010100002031 is a prime.
It is a super-3 number, since 3×1020101000020313 (a number of 43 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102010100002231) 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, 1723265 + ... + 14387141.
It is an arithmetic number, because the mean of its divisors is an integer number (6884160064068).
Almost surely, 2102010100002031 is an apocalyptic number.
102010100002031 is a deficient number, since it is larger than the sum of its proper divisors (8136461023057).
102010100002031 is a wasteful number, since it uses less digits than its factorization.
102010100002031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 12665522.
The product of its (nonzero) digits is 12, while the sum is 11.
Adding to 102010100002031 its reverse (130200001010201), we get a palindrome (232210101012232).
The spelling of 102010100002031 in words is "one hundred two trillion, ten billion, one hundred million, two thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •