Base | Representation |
---|---|
bin | 11101101011111001101… |
… | …11010001001011010011 |
3 | 10121111210200221000010211 |
4 | 32311330313101023103 |
5 | 113202431020042321 |
6 | 2100325453104551 |
7 | 133456413620665 |
oct | 16657467211323 |
9 | 3544720830124 |
10 | 1020002112211 |
11 | 363642667945 |
12 | 145824788157 |
13 | 752552329b4 |
14 | 37522b1c535 |
15 | 1b7ec79d0e1 |
hex | ed7cdd12d3 |
1020002112211 has 4 divisors (see below), whose sum is σ = 1022624226000. Its totient is φ = 1017379998424.
The previous prime is 1020002112209. The next prime is 1020002112251. The reversal of 1020002112211 is 1122112000201.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 1020002112211 - 21 = 1020002112209 is a prime.
It is a super-3 number, since 3×10200021122113 (a number of 37 digits) contains 333 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1020002112191 and 1020002112200.
It is not an unprimeable number, because it can be changed into a prime (1020002112251) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1311056311 + ... + 1311057088.
It is an arithmetic number, because the mean of its divisors is an integer number (255656056500).
Almost surely, 21020002112211 is an apocalyptic number.
1020002112211 is a deficient number, since it is larger than the sum of its proper divisors (2622113789).
1020002112211 is an equidigital number, since it uses as much as digits as its factorization.
1020002112211 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2622113788.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 1020002112211 its reverse (1122112000201), we get a palindrome (2142114112412).
The spelling of 1020002112211 in words is "one trillion, twenty billion, two million, one hundred twelve thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •