Base | Representation |
---|---|
bin | 10000001010101101111… |
… | …101010101100110101101 |
3 | 10221012201220022212000002 |
4 | 100022231331111212231 |
5 | 121200332121200023 |
6 | 2210221240314045 |
7 | 143161054014005 |
oct | 20125575254655 |
9 | 3835656285002 |
10 | 1111020100013 |
11 | 3991a997826a |
12 | 15b3a6472925 |
13 | 809cbc1c705 |
14 | 3bab8ccb005 |
15 | 1dd781b0b28 |
hex | 102adf559ad |
1111020100013 has 8 divisors (see below), whose sum is σ = 1114488697920. Its totient is φ = 1107552519360.
The previous prime is 1111020100007. The next prime is 1111020100063. The reversal of 1111020100013 is 3100010201111.
It is a happy number.
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 1111020100013 - 210 = 1111020098989 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1111020099967 and 1111020100003.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1111020100063) 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, 1963568 + ... + 2465286.
It is an arithmetic number, because the mean of its divisors is an integer number (139311087240).
Almost surely, 21111020100013 is an apocalyptic number.
It is an amenable number.
1111020100013 is a deficient number, since it is larger than the sum of its proper divisors (3468597907).
1111020100013 is an equidigital number, since it uses as much as digits as its factorization.
1111020100013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 508627.
The product of its (nonzero) digits is 6, while the sum is 11.
Adding to 1111020100013 its reverse (3100010201111), we get a palindrome (4211030301124).
The spelling of 1111020100013 in words is "one trillion, one hundred eleven billion, twenty million, one hundred thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •