Base | Representation |
---|---|
bin | 100000010101011111100… |
… | …011011101001001110001 |
3 | 21212102122001110221102022 |
4 | 200111133203131021301 |
5 | 242401330403101001 |
6 | 4420452541001225 |
7 | 316353511512443 |
oct | 40253743351161 |
9 | 7772561427368 |
10 | 2222101222001 |
11 | 78742a234211 |
12 | 2ba7a9253215 |
13 | 13170a6862ab |
14 | 7979bd40493 |
15 | 3cc068c711b |
hex | 2055f8dd271 |
2222101222001 has 8 divisors (see below), whose sum is σ = 2310276792000. Its totient is φ = 2134695744720.
The previous prime is 2222101221973. The next prime is 2222101222057. The reversal of 2222101222001 is 1002221012222.
It is a happy number.
2222101222001 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 2222101222001 - 234 = 2204921352817 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2222101222091) 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, 192517295 + ... + 192528836.
It is an arithmetic number, because the mean of its divisors is an integer number (288784599000).
Almost surely, 22222101222001 is an apocalyptic number.
It is an amenable number.
2222101222001 is a deficient number, since it is larger than the sum of its proper divisors (88175569999).
2222101222001 is a wasteful number, since it uses less digits than its factorization.
2222101222001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 385046359.
The product of its (nonzero) digits is 128, while the sum is 17.
Adding to 2222101222001 its reverse (1002221012222), we get a palindrome (3224322234223).
The spelling of 2222101222001 in words is "two trillion, two hundred twenty-two billion, one hundred one million, two hundred twenty-two thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •