Base | Representation |
---|---|
bin | 10111001101111001011101… |
… | …000000111101111101111101 |
3 | 111101112122001100020212122122 |
4 | 113031321131000331331331 |
5 | 101340433002413430023 |
6 | 1001100423252052325 |
7 | 30336132535022324 |
oct | 2715713500757575 |
9 | 441478040225578 |
10 | 102110113030013 |
11 | 2a598723889200 |
12 | b55175a3040a5 |
13 | 44c8c3343077a |
14 | 1b302278a90bb |
15 | bc11b97702c8 |
hex | 5cde5d03df7d |
102110113030013 has 24 divisors (see below), whose sum is σ = 113418967152960. Its totient is φ = 91850014713600.
The previous prime is 102110113030007. The next prime is 102110113030027. The reversal of 102110113030013 is 310030311011201.
It is not a de Polignac number, because 102110113030013 - 224 = 102110096252797 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 102110113029973 and 102110113030000.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102110113033013) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 52076918 + ... + 54002088.
It is an arithmetic number, because the mean of its divisors is an integer number (4725790298040).
Almost surely, 2102110113030013 is an apocalyptic number.
It is an amenable number.
102110113030013 is a deficient number, since it is larger than the sum of its proper divisors (11308854122947).
102110113030013 is a wasteful number, since it uses less digits than its factorization.
102110113030013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1929809 (or 1929798 counting only the distinct ones).
The product of its (nonzero) digits is 54, while the sum is 17.
Adding to 102110113030013 its reverse (310030311011201), we get a palindrome (412140424041214).
The spelling of 102110113030013 in words is "one hundred two trillion, one hundred ten billion, one hundred thirteen million, thirty thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •