Base | Representation |
---|---|
bin | 110010100001101000000100… |
… | …111101101010010001101101 |
3 | 1002010210100212002111201002011 |
4 | 302201220010331222101231 |
5 | 213111214412403431021 |
6 | 2104335142303401221 |
7 | 64543236541416025 |
oct | 6241500475522155 |
9 | 1063710762451064 |
10 | 222213101233261 |
11 | 64893057620876 |
12 | 20b0a479bb3211 |
13 | 96cb7b4480a78 |
14 | 3cc32587b0a85 |
15 | 1aa5415623de1 |
hex | ca1a04f6a46d |
222213101233261 has 2 divisors, whose sum is σ = 222213101233262. Its totient is φ = 222213101233260.
The previous prime is 222213101233247. The next prime is 222213101233339. The reversal of 222213101233261 is 162332101312222.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 221217135156900 + 995966076361 = 14873370^2 + 997981^2 .
It is a cyclic number.
It is not a de Polignac number, because 222213101233261 - 217 = 222213101102189 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (222213101233231) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 111106550616630 + 111106550616631.
It is an arithmetic number, because the mean of its divisors is an integer number (111106550616631).
Almost surely, 2222213101233261 is an apocalyptic number.
It is an amenable number.
222213101233261 is a deficient number, since it is larger than the sum of its proper divisors (1).
222213101233261 is an equidigital number, since it uses as much as digits as its factorization.
222213101233261 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 10368, while the sum is 31.
Adding to 222213101233261 its reverse (162332101312222), we get a palindrome (384545202545483).
The spelling of 222213101233261 in words is "two hundred twenty-two trillion, two hundred thirteen billion, one hundred one million, two hundred thirty-three thousand, two hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •