Base | Representation |
---|---|
bin | 1100111011110010000… |
… | …0110100111100001001 |
3 | 210020112220220010010112 |
4 | 3032330200310330021 |
5 | 12120034222213103 |
6 | 250025142524105 |
7 | 22024321203446 |
oct | 3167440647411 |
9 | 706486803115 |
10 | 222206054153 |
11 | 86267585376 |
12 | 37094436635 |
13 | 17c52a67ca5 |
14 | aa7d37c9cd |
15 | 5ba7c05cd8 |
hex | 33bc834f09 |
222206054153 has 2 divisors, whose sum is σ = 222206054154. Its totient is φ = 222206054152.
The previous prime is 222206054131. The next prime is 222206054183. The reversal of 222206054153 is 351450602222.
222206054153 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 214546828864 + 7659225289 = 463192^2 + 87517^2 .
It is a cyclic number.
It is not a de Polignac number, because 222206054153 - 28 = 222206053897 is a prime.
It is not a weakly prime, because it can be changed into another prime (222206054183) 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 as a sum of consecutive naturals, namely, 111103027076 + 111103027077.
It is an arithmetic number, because the mean of its divisors is an integer number (111103027077).
Almost surely, 2222206054153 is an apocalyptic number.
It is an amenable number.
222206054153 is a deficient number, since it is larger than the sum of its proper divisors (1).
222206054153 is an equidigital number, since it uses as much as digits as its factorization.
222206054153 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 28800, while the sum is 32.
Adding to 222206054153 its reverse (351450602222), we get a palindrome (573656656375).
The spelling of 222206054153 in words is "two hundred twenty-two billion, two hundred six million, fifty-four thousand, one hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •