Base | Representation |
---|---|
bin | 110010100001100101011000… |
… | …110011111011001111000101 |
3 | 1002010210002101210210021001211 |
4 | 302201211120303323033011 |
5 | 213111143004012001013 |
6 | 2104333543530451421 |
7 | 64543105141014211 |
oct | 6241453063731705 |
9 | 1063702353707054 |
10 | 222210213000133 |
11 | 64891905259546 |
12 | 20b099b2893b71 |
13 | 96cb443c9cb97 |
14 | 3cc3062d7d941 |
15 | 1aa52e6cab23d |
hex | ca1958cfb3c5 |
222210213000133 has 2 divisors, whose sum is σ = 222210213000134. Its totient is φ = 222210213000132.
The previous prime is 222210213000109. The next prime is 222210213000143. The reversal of 222210213000133 is 331000312012222.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 206840974789089 + 15369238211044 = 14381967^2 + 3920362^2 .
It is a cyclic number.
It is not a de Polignac number, because 222210213000133 - 213 = 222210212991941 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (222210213000143) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 111105106500066 + 111105106500067.
It is an arithmetic number, because the mean of its divisors is an integer number (111105106500067).
Almost surely, 2222210213000133 is an apocalyptic number.
It is an amenable number.
222210213000133 is a deficient number, since it is larger than the sum of its proper divisors (1).
222210213000133 is an equidigital number, since it uses as much as digits as its factorization.
222210213000133 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 864, while the sum is 22.
Adding to 222210213000133 its reverse (331000312012222), we get a palindrome (553210525012355).
The spelling of 222210213000133 in words is "two hundred twenty-two trillion, two hundred ten billion, two hundred thirteen million, one hundred thirty-three", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •