Base | Representation |
---|---|
bin | 101111100011001101… |
… | …0100100010011010101 |
3 | 100202120102210222220012 |
4 | 1133012122210103111 |
5 | 3133111423213023 |
6 | 114524330050005 |
7 | 10243313015600 |
oct | 1370632442325 |
9 | 322512728805 |
10 | 102113101013 |
11 | 3a340202180 |
12 | 17959579905 |
13 | 9824536781 |
14 | 4d2995b337 |
15 | 29c99dd978 |
hex | 17c66a44d5 |
102113101013 has 12 divisors (see below), whose sum is σ = 129583230912. Its totient is φ = 79568649720.
The previous prime is 102113101009. The next prime is 102113101033. The reversal of 102113101013 is 310101311201.
It is a happy number.
It is not a de Polignac number, because 102113101013 - 22 = 102113101009 is a prime.
It is a super-2 number, since 2×1021131010132 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102113101033) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 94724045 + ... + 94725122.
It is an arithmetic number, because the mean of its divisors is an integer number (10798602576).
Almost surely, 2102113101013 is an apocalyptic number.
It is an amenable number.
102113101013 is a deficient number, since it is larger than the sum of its proper divisors (27470129899).
102113101013 is a wasteful number, since it uses less digits than its factorization.
102113101013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 189449192 (or 189449185 counting only the distinct ones).
The product of its (nonzero) digits is 18, while the sum is 14.
Adding to 102113101013 its reverse (310101311201), we get a palindrome (412214412214).
The spelling of 102113101013 in words is "one hundred two billion, one hundred thirteen million, one hundred one thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •