Base | Representation |
---|---|
bin | 1100111011011101110… |
… | …1111110110010110001 |
3 | 210020100000122100122101 |
4 | 3032313131332302301 |
5 | 12114401041001001 |
6 | 250012520540401 |
7 | 22022242635463 |
oct | 3166735766261 |
9 | 706300570571 |
10 | 222121422001 |
11 | 8622382aa46 |
12 | 37070021701 |
13 | 17c3b3753ab |
14 | aa7202c133 |
15 | 5ba0589a01 |
hex | 33b777ecb1 |
222121422001 has 8 divisors (see below), whose sum is σ = 223177091904. Its totient is φ = 221067941520.
The previous prime is 222121421989. The next prime is 222121422011. The reversal of 222121422001 is 100224121222.
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 222121422001 - 213 = 222121413809 is a prime.
It is a super-2 number, since 2×2221214220012 (a number of 23 digits) contains 22 as substring.
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 222121422001.
It is not an unprimeable number, because it can be changed into a prime (222121422011) 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, 343791 + ... + 749956.
It is an arithmetic number, because the mean of its divisors is an integer number (27897136488).
Almost surely, 2222121422001 is an apocalyptic number.
It is an amenable number.
222121422001 is a deficient number, since it is larger than the sum of its proper divisors (1055669903).
222121422001 is a wasteful number, since it uses less digits than its factorization.
222121422001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1094711.
The product of its (nonzero) digits is 256, while the sum is 19.
Adding to 222121422001 its reverse (100224121222), we get a palindrome (322345543223).
The spelling of 222121422001 in words is "two hundred twenty-two billion, one hundred twenty-one million, four hundred twenty-two thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •