Base | Representation |
---|---|
bin | 10000001010101100110… |
… | …000101111100000010011 |
3 | 10221012200111112201210100 |
4 | 100022230300233200103 |
5 | 121200312001133021 |
6 | 2210215242103443 |
7 | 143160421235436 |
oct | 20125460574023 |
9 | 3835614481710 |
10 | 1111000021011 |
11 | 399199603651 |
12 | 15b39b7aab83 |
13 | 809c7a0c34a |
14 | 3bab638181d |
15 | 1dd76546626 |
hex | 102acc2f813 |
1111000021011 has 12 divisors (see below), whose sum is σ = 1605564876240. Its totient is φ = 740303418480.
The previous prime is 1111000021007. The next prime is 1111000021057. The reversal of 1111000021011 is 1101200001111.
It is not a de Polignac number, because 1111000021011 - 22 = 1111000021007 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a junction number, because it is equal to n+sod(n) for n = 1111000020984 and 1111000021002.
It is not an unprimeable number, because it can be changed into a prime (1111000021081) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 30252480 + ... + 30289181.
It is an arithmetic number, because the mean of its divisors is an integer number (133797073020).
Almost surely, 21111000021011 is an apocalyptic number.
1111000021011 is a deficient number, since it is larger than the sum of its proper divisors (494564855229).
1111000021011 is a wasteful number, since it uses less digits than its factorization.
1111000021011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 60543706 (or 60543703 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 9.
Adding to 1111000021011 its reverse (1101200001111), we get a palindrome (2212200022122).
The spelling of 1111000021011 in words is "one trillion, one hundred eleven billion, twenty-one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •