Base | Representation |
---|---|
bin | 1010000110011101011111… |
… | …00110111010100111110001 |
3 | 2220122110121221122011010201 |
4 | 11003032233212322213301 |
5 | 10402411112324231001 |
6 | 115124053131155201 |
7 | 4451531366440261 |
oct | 503165746724761 |
9 | 86573557564121 |
10 | 22212222102001 |
11 | 709417233a168 |
12 | 25a8a642a5b01 |
13 | c517b0024199 |
14 | 56b1121037a1 |
15 | 287bce2cb501 |
hex | 1433af9ba9f1 |
22212222102001 has 8 divisors (see below), whose sum is σ = 22659089957504. Its totient is φ = 21769800693120.
The previous prime is 22212222101999. The next prime is 22212222102013. The reversal of 22212222102001 is 10020122221222.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 22212222102001 - 21 = 22212222101999 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 22212222102001.
It is not an unprimeable number, because it can be changed into a prime (22212222102701) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1111601565 + ... + 1111621546.
It is an arithmetic number, because the mean of its divisors is an integer number (2832386244688).
Almost surely, 222212222102001 is an apocalyptic number.
It is an amenable number.
22212222102001 is a deficient number, since it is larger than the sum of its proper divisors (446867855503).
22212222102001 is a wasteful number, since it uses less digits than its factorization.
22212222102001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2223223311.
The product of its (nonzero) digits is 256, while the sum is 19.
Adding to 22212222102001 its reverse (10020122221222), we get a palindrome (32232344323223).
The spelling of 22212222102001 in words is "twenty-two trillion, two hundred twelve billion, two hundred twenty-two million, one hundred two thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •