Base | Representation |
---|---|
bin | 11001001111011011111110… |
… | …111100100011111010010011 |
3 | 112120001122101021220001020211 |
4 | 121033123332330203322103 |
5 | 104022310040004133021 |
6 | 1032034113143144551 |
7 | 32245231620000520 |
oct | 3117337674437223 |
9 | 476048337801224 |
10 | 111012002021011 |
11 | 3240aa20078113 |
12 | 1054aa52a45157 |
13 | 49c3504c5b680 |
14 | 1d5b01c370147 |
15 | cc7a249983e1 |
hex | 64f6fef23e93 |
111012002021011 has 16 divisors (see below), whose sum is σ = 136634550107328. Its totient is φ = 87830847360000.
The previous prime is 111012002021009. The next prime is 111012002021083. The reversal of 111012002021011 is 110120200210111.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 111012002021011 - 21 = 111012002021009 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (13).
It is a junction number, because it is equal to n+sod(n) for n = 111012002020982 and 111012002021000.
It is not an unprimeable number, because it can be changed into a prime (111012002021611) 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, 16767490 + ... + 22431511.
It is an arithmetic number, because the mean of its divisors is an integer number (8539659381708).
Almost surely, 2111012002021011 is an apocalyptic number.
111012002021011 is a deficient number, since it is larger than the sum of its proper divisors (25622548086317).
111012002021011 is a wasteful number, since it uses less digits than its factorization.
111012002021011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 39230142.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 111012002021011 its reverse (110120200210111), we get a palindrome (221132202231122).
The spelling of 111012002021011 in words is "one hundred eleven trillion, twelve billion, two million, twenty-one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •