Base | Representation |
---|---|
bin | 11101000110101011111… |
… | …01001100010101110011 |
3 | 10112121020020211012012022 |
4 | 32203111331030111303 |
5 | 112341021113013021 |
6 | 2043223114022055 |
7 | 132151322520635 |
oct | 16432575142563 |
9 | 3477206735168 |
10 | 1000022001011 |
11 | 35611a392650 |
12 | 14198941792b |
13 | 733bc9cc9a7 |
14 | 36589332a55 |
15 | 1b02d6601ab |
hex | e8d5f4c573 |
1000022001011 has 16 divisors (see below), whose sum is σ = 1097064573696. Its totient is φ = 904002300000.
The previous prime is 1000022001001. The next prime is 1000022001059. The reversal of 1000022001011 is 1101002200001.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1000022001011 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1000022001011.
It is not an unprimeable number, because it can be changed into a prime (1000022001001) 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 15 ways as a sum of consecutive naturals, for example, 31184936 + ... + 31216986.
It is an arithmetic number, because the mean of its divisors is an integer number (68566535856).
Almost surely, 21000022001011 is an apocalyptic number.
1000022001011 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
1000022001011 is a deficient number, since it is larger than the sum of its proper divisors (97042572685).
1000022001011 is a wasteful number, since it uses less digits than its factorization.
1000022001011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 47914.
The product of its (nonzero) digits is 4, while the sum is 8.
Adding to 1000022001011 its reverse (1101002200001), we get a palindrome (2101024201012).
The spelling of 1000022001011 in words is "one trillion, twenty-two million, one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •