Base | Representation |
---|---|
bin | 1010000110011011011001… |
… | …10110000100011101101001 |
3 | 2220122100201212222010102111 |
4 | 11003031230312010131221 |
5 | 10402401314103013001 |
6 | 115123350035402321 |
7 | 4451461545644554 |
oct | 503155466043551 |
9 | 86570655863374 |
10 | 22211102001001 |
11 | 7093748045761 |
12 | 25a87b11533a1 |
13 | c51661c56124 |
14 | 56b04745169b |
15 | 287b65cc4851 |
hex | 14336cd84769 |
22211102001001 has 4 divisors (see below), whose sum is σ = 22326185431252. Its totient is φ = 22096018570752.
The previous prime is 22211102000981. The next prime is 22211102001037. The reversal of 22211102001001 is 10010020111222.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 15728553173776 + 6482548827225 = 3965924^2 + 2546085^2 .
It is a cyclic number.
It is not a de Polignac number, because 22211102001001 - 221 = 22211099903849 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (22211102001401) 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, 57541714836 + ... + 57541715221.
It is an arithmetic number, because the mean of its divisors is an integer number (5581546357813).
Almost surely, 222211102001001 is an apocalyptic number.
It is an amenable number.
22211102001001 is a deficient number, since it is larger than the sum of its proper divisors (115083430251).
22211102001001 is a wasteful number, since it uses less digits than its factorization.
22211102001001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 115083430250.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 22211102001001 its reverse (10010020111222), we get a palindrome (32221122112223).
The spelling of 22211102001001 in words is "twenty-two trillion, two hundred eleven billion, one hundred two million, one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •