Base | Representation |
---|---|
bin | 10000001010101101010… |
… | …111001111011001011001 |
3 | 10221012201012112110112220 |
4 | 100022231113033121121 |
5 | 121200322042104423 |
6 | 2210220242254253 |
7 | 143160603100455 |
oct | 20125527173131 |
9 | 3835635473486 |
10 | 1111010113113 |
11 | 3991a4276a2a |
12 | 15b3a3057389 |
13 | 809c9b33ac4 |
14 | 3bab784b665 |
15 | 1dd7738b9e3 |
hex | 102ad5cf659 |
1111010113113 has 16 divisors (see below), whose sum is σ = 1518253573056. Its totient is φ = 722275868160.
The previous prime is 1111010113091. The next prime is 1111010113189. The reversal of 1111010113113 is 3113110101111.
It is not a de Polignac number, because 1111010113113 - 217 = 1111009982041 is a prime.
It is a super-2 number, since 2×11110101131132 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1111010113092 and 1111010113101.
It is not an unprimeable number, because it can be changed into a prime (1111010113013) 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, 6899728 + ... + 7058913.
It is an arithmetic number, because the mean of its divisors is an integer number (94890848316).
Almost surely, 21111010113113 is an apocalyptic number.
It is an amenable number.
1111010113113 is a deficient number, since it is larger than the sum of its proper divisors (407243459943).
1111010113113 is a wasteful number, since it uses less digits than its factorization.
1111010113113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13959304.
The product of its (nonzero) digits is 9, while the sum is 15.
Adding to 1111010113113 its reverse (3113110101111), we get a palindrome (4224120214224).
The spelling of 1111010113113 in words is "one trillion, one hundred eleven billion, ten million, one hundred thirteen thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •