Base | Representation |
---|---|
bin | 11101001010011010010… |
… | …10101000000011100111 |
3 | 10112210101122012020021110 |
4 | 32211031022220003213 |
5 | 112404120113323421 |
6 | 2044153401120103 |
7 | 132252016364112 |
oct | 16451512500347 |
9 | 3483348166243 |
10 | 1002022011111 |
11 | 356a56336860 |
12 | 142247189033 |
13 | 7364b17b814 |
14 | 366d8bd1579 |
15 | 1b0e9025a76 |
hex | e94d2a80e7 |
1002022011111 has 32 divisors (see below), whose sum is σ = 1519398475776. Its totient is φ = 581877360000.
The previous prime is 1002022011059. The next prime is 1002022011113. The reversal of 1002022011111 is 1111102202001.
It is not a de Polignac number, because 1002022011111 - 217 = 1002021880039 is a prime.
It is a super-2 number, since 2×10020220111112 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1002022011113) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 4745656 + ... + 4952301.
It is an arithmetic number, because the mean of its divisors is an integer number (47481202368).
Almost surely, 21002022011111 is an apocalyptic number.
1002022011111 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
1002022011111 is a deficient number, since it is larger than the sum of its proper divisors (517376464665).
1002022011111 is a wasteful number, since it uses less digits than its factorization.
1002022011111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9698103.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 1002022011111 its reverse (1111102202001), we get a palindrome (2113124213112).
The spelling of 1002022011111 in words is "one trillion, two billion, twenty-two million, eleven thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •