Base | Representation |
---|---|
bin | 1001000111010111001110… |
… | …1101011110000110111011 |
3 | 1022111002210101021122011202 |
4 | 2101311303231132012323 |
5 | 2303200230100014321 |
6 | 33152031132444415 |
7 | 2053033660301564 |
oct | 221656355360673 |
9 | 38432711248152 |
10 | 10022100001211 |
11 | 32143921a2031 |
12 | 115a42501970b |
13 | 57910692170c |
14 | 2691022a116b |
15 | 125a7022670b |
hex | 91d73b5e1bb |
10022100001211 has 4 divisors (see below), whose sum is σ = 10022108091912. Its totient is φ = 10022091910512.
The previous prime is 10022100001201. The next prime is 10022100001223. The reversal of 10022100001211 is 11210000122001.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10022100001211 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10022100001192 and 10022100001201.
It is not an unprimeable number, because it can be changed into a prime (10022100001201) 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, 1755050 + ... + 4808783.
It is an arithmetic number, because the mean of its divisors is an integer number (2505527022978).
Almost surely, 210022100001211 is an apocalyptic number.
10022100001211 is a deficient number, since it is larger than the sum of its proper divisors (8090701).
10022100001211 is an equidigital number, since it uses as much as digits as its factorization.
10022100001211 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 8090700.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 10022100001211 its reverse (11210000122001), we get a palindrome (21232100123212).
The spelling of 10022100001211 in words is "ten trillion, twenty-two billion, one hundred million, one thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •