Base | Representation |
---|---|
bin | 110010011110100001101000… |
… | …010101010011110011000111 |
3 | 1002010000222212002121010210222 |
4 | 302132201220111103303013 |
5 | 213044222020110342411 |
6 | 2104053222401334555 |
7 | 64521654310054256 |
oct | 6236415025236307 |
9 | 1063028762533728 |
10 | 222000020012231 |
11 | 6481075284a6aa |
12 | 20a9511163745b |
13 | 96b4686cc2b26 |
14 | 3cb6c0326079d |
15 | 1a9eae3a574db |
hex | c9e868553cc7 |
222000020012231 has 2 divisors, whose sum is σ = 222000020012232. Its totient is φ = 222000020012230.
The previous prime is 222000020012167. The next prime is 222000020012263. The reversal of 222000020012231 is 132210020000222.
222000020012231 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 222000020012231 - 26 = 222000020012167 is a prime.
It is a super-2 number, since 2×2220000200122312 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (222000020012291) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 111000010006115 + 111000010006116.
It is an arithmetic number, because the mean of its divisors is an integer number (111000010006116).
Almost surely, 2222000020012231 is an apocalyptic number.
222000020012231 is a deficient number, since it is larger than the sum of its proper divisors (1).
222000020012231 is an equidigital number, since it uses as much as digits as its factorization.
222000020012231 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 192, while the sum is 17.
Adding to 222000020012231 its reverse (132210020000222), we get a palindrome (354210040012453).
The spelling of 222000020012231 in words is "two hundred twenty-two trillion, twenty million, twelve thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •