Base | Representation |
---|---|
bin | 11101001010100101000… |
… | …10101111101101101011 |
3 | 10112210121220221022121211 |
4 | 32211102202233231223 |
5 | 112404311212020021 |
6 | 2044210342413551 |
7 | 132254163216610 |
oct | 16452242575553 |
9 | 3483556838554 |
10 | 1002112220011 |
11 | 356aa2250071 |
12 | 1422714312b7 |
13 | 73663a74876 |
14 | 36706b94507 |
15 | 1b101de43e1 |
hex | e9528afb6b |
1002112220011 has 4 divisors (see below), whose sum is σ = 1145271108592. Its totient is φ = 858953331432.
The previous prime is 1002112220003. The next prime is 1002112220063. The reversal of 1002112220011 is 1100222112001.
It is a semiprime because it is the product of two primes.
It is not a de Polignac number, because 1002112220011 - 23 = 1002112220003 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1002112219973 and 1002112220000.
It is not an unprimeable number, because it can be changed into a prime (1002112220071) 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 3 ways as a sum of consecutive naturals, for example, 71579444280 + ... + 71579444293.
It is an arithmetic number, because the mean of its divisors is an integer number (286317777148).
Almost surely, 21002112220011 is an apocalyptic number.
1002112220011 is a deficient number, since it is larger than the sum of its proper divisors (143158888581).
1002112220011 is an equidigital number, since it uses as much as digits as its factorization.
1002112220011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 143158888580.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 1002112220011 its reverse (1100222112001), we get a palindrome (2102334332012).
The spelling of 1002112220011 in words is "one trillion, two billion, one hundred twelve million, two hundred twenty thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •