Base | Representation |
---|---|
bin | 111101111100010111… |
… | …1000101010111110101 |
3 | 110201100112120101212001 |
4 | 1323320233011113311 |
5 | 4134412130024341 |
6 | 141035353255301 |
7 | 12416261201146 |
oct | 1737057052765 |
9 | 421315511761 |
10 | 133022111221 |
11 | 5146157200a |
12 | 21944a04531 |
13 | c70c02b41c |
14 | 661c9c9acd |
15 | 36d8323d31 |
hex | 1ef8bc55f5 |
133022111221 has 2 divisors, whose sum is σ = 133022111222. Its totient is φ = 133022111220.
The previous prime is 133022111143. The next prime is 133022111227. The reversal of 133022111221 is 122111220331.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 77556680100 + 55465431121 = 278490^2 + 235511^2 .
It is an emirp because it is prime and its reverse (122111220331) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 133022111221 - 211 = 133022109173 is a prime.
It is a super-2 number, since 2×1330221112212 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (133022111227) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 66511055610 + 66511055611.
It is an arithmetic number, because the mean of its divisors is an integer number (66511055611).
Almost surely, 2133022111221 is an apocalyptic number.
It is an amenable number.
133022111221 is a deficient number, since it is larger than the sum of its proper divisors (1).
133022111221 is an equidigital number, since it uses as much as digits as its factorization.
133022111221 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 144, while the sum is 19.
Adding to 133022111221 its reverse (122111220331), we get a palindrome (255133331552).
The spelling of 133022111221 in words is "one hundred thirty-three billion, twenty-two million, one hundred eleven thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •