Base | Representation |
---|---|
bin | 111101111100010111… |
… | …0101010110000110111 |
3 | 110201100112100212100101 |
4 | 1323320232222300313 |
5 | 4134412113032411 |
6 | 141035351054531 |
7 | 12416260235326 |
oct | 1737056526067 |
9 | 421315325311 |
10 | 133022002231 |
11 | 514614a8138 |
12 | 21944971447 |
13 | c70bcc0931 |
14 | 661c99c0bd |
15 | 36d83018c1 |
hex | 1ef8baac37 |
133022002231 has 2 divisors, whose sum is σ = 133022002232. Its totient is φ = 133022002230.
The previous prime is 133022002207. The next prime is 133022002259. The reversal of 133022002231 is 132200220331.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 133022002231 - 219 = 133021477943 is a prime.
It is a super-2 number, since 2×1330220022312 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 133022002199 and 133022002208.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (133022072231) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 66511001115 + 66511001116.
It is an arithmetic number, because the mean of its divisors is an integer number (66511001116).
Almost surely, 2133022002231 is an apocalyptic number.
133022002231 is a deficient number, since it is larger than the sum of its proper divisors (1).
133022002231 is an equidigital number, since it uses as much as digits as its factorization.
133022002231 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 432, while the sum is 19.
Adding to 133022002231 its reverse (132200220331), we get a palindrome (265222222562).
The spelling of 133022002231 in words is "one hundred thirty-three billion, twenty-two million, two thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •