Base | Representation |
---|---|
bin | 1100111011000001011… |
… | …0011011010101100100 |
3 | 210020000200221011011200 |
4 | 3032300112123111210 |
5 | 12114130003020002 |
6 | 245553013202500 |
7 | 22016262606153 |
oct | 3166026332544 |
9 | 706020834150 |
10 | 222002001252 |
11 | 86172384409 |
12 | 37038030430 |
13 | 17c1c6c2025 |
14 | aa6022359a |
15 | 5b94d4ab1c |
hex | 33b059b564 |
222002001252 has 36 divisors (see below), whose sum is σ = 585570498240. Its totient is φ = 70783246512.
The previous prime is 222002001251. The next prime is 222002001257. The reversal of 222002001252 is 252100200222.
222002001252 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a tau number, because it is divible by the number of its divisors (36).
It is a Harshad number since it is a multiple of its sum of digits (18).
It is not an unprimeable number, because it can be changed into a prime (222002001251) 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 11 ways as a sum of consecutive naturals, for example, 134058352 + ... + 134060007.
Almost surely, 2222002001252 is an apocalyptic number.
It is an amenable number.
222002001252 is an abundant number, since it is smaller than the sum of its proper divisors (363568496988).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
222002001252 is a wasteful number, since it uses less digits than its factorization.
222002001252 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 268118392 (or 268118387 counting only the distinct ones).
The product of its (nonzero) digits is 320, while the sum is 18.
Adding to 222002001252 its reverse (252100200222), we get a palindrome (474102201474).
The spelling of 222002001252 in words is "two hundred twenty-two billion, two million, one thousand, two hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •