Base | Representation |
---|---|
bin | 110010100000000000100110… |
… | …110100011110001101101001 |
3 | 1002010101202002021010101010011 |
4 | 302200000212310132031221 |
5 | 213102404344011201301 |
6 | 2104212130020451521 |
7 | 64532224416363064 |
oct | 6240004664361551 |
9 | 1063352067111104 |
10 | 222102000100201 |
11 | 6484aa24962141 |
12 | 20ab0a32549ba1 |
13 | 96c1189ac7550 |
14 | 3cbbb192758db |
15 | 1aa25b1a1ea51 |
hex | ca0026d1e369 |
222102000100201 has 8 divisors (see below), whose sum is σ = 239187008882304. Its totient is φ = 205017025538640.
The previous prime is 222102000100159. The next prime is 222102000100249. The reversal of 222102000100201 is 102001000201222.
It is a happy number.
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 222102000100201 - 27 = 222102000100073 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (13).
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (222102000100261) 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, 5819280 + ... + 21864766.
It is an arithmetic number, because the mean of its divisors is an integer number (29898376110288).
Almost surely, 2222102000100201 is an apocalyptic number.
It is an amenable number.
222102000100201 is a deficient number, since it is larger than the sum of its proper divisors (17085008782103).
222102000100201 is a wasteful number, since it uses less digits than its factorization.
222102000100201 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 17110271.
The product of its (nonzero) digits is 32, while the sum is 13.
Adding to 222102000100201 its reverse (102001000201222), we get a palindrome (324103000301423).
The spelling of 222102000100201 in words is "two hundred twenty-two trillion, one hundred two billion, one hundred thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •