Base | Representation |
---|---|
bin | 1100111011000001011… |
… | …0011101100001011001 |
3 | 210020000200221121110010 |
4 | 3032300112131201121 |
5 | 12114130003311301 |
6 | 245553013312133 |
7 | 22016262644226 |
oct | 3166026354131 |
9 | 706020847403 |
10 | 222002010201 |
11 | 86172390104 |
12 | 37038035649 |
13 | 17c1c6c611a |
14 | aa6022694d |
15 | 5b94d4d5d6 |
hex | 33b059d859 |
222002010201 has 8 divisors (see below), whose sum is σ = 299328553440. Its totient is φ = 146338403552.
The previous prime is 222002010161. The next prime is 222002010211. The reversal of 222002010201 is 102010200222.
222002010201 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 222002010201 - 211 = 222002008153 is a prime.
It is not an unprimeable number, because it can be changed into a prime (222002010211) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 415733835 + ... + 415734368.
It is an arithmetic number, because the mean of its divisors is an integer number (37416069180).
Almost surely, 2222002010201 is an apocalyptic number.
It is an amenable number.
222002010201 is a deficient number, since it is larger than the sum of its proper divisors (77326543239).
222002010201 is an equidigital number, since it uses as much as digits as its factorization.
222002010201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 831468295.
The product of its (nonzero) digits is 32, while the sum is 12.
Adding to 222002010201 its reverse (102010200222), we get a palindrome (324012210423).
The spelling of 222002010201 in words is "two hundred twenty-two billion, two million, ten thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •