Base | Representation |
---|---|
bin | 10111001100010011110110… |
… | …000010001011110000110101 |
3 | 111101011012102211202020112220 |
4 | 113030103312002023300311 |
5 | 101332141032321104023 |
6 | 1000534341223232553 |
7 | 30325221100024545 |
oct | 2714236602136065 |
9 | 441135384666486 |
10 | 102001011113013 |
11 | 2a556427681151 |
12 | b5345902a8759 |
13 | 44bb86700882c |
14 | 1b28c37aa3325 |
15 | bbd4314263e3 |
hex | 5cc4f608bc35 |
102001011113013 has 32 divisors (see below), whose sum is σ = 143034548944896. Its totient is φ = 64530763532928.
The previous prime is 102001011113011. The next prime is 102001011113041. The reversal of 102001011113013 is 310311110100201.
It is not a de Polignac number, because 102001011113013 - 21 = 102001011113011 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 102001011112983 and 102001011113001.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102001011113011) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 864524881 + ... + 864642857.
It is an arithmetic number, because the mean of its divisors is an integer number (4469829654528).
Almost surely, 2102001011113013 is an apocalyptic number.
It is an amenable number.
102001011113013 is a deficient number, since it is larger than the sum of its proper divisors (41033537831883).
102001011113013 is a wasteful number, since it uses less digits than its factorization.
102001011113013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 216793.
The product of its (nonzero) digits is 18, while the sum is 15.
Adding to 102001011113013 its reverse (310311110100201), we get a palindrome (412312121213214).
The spelling of 102001011113013 in words is "one hundred two trillion, one billion, eleven million, one hundred thirteen thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •