Base | Representation |
---|---|
bin | 111110000010100100… |
… | …0111110010000101111 |
3 | 110201220001011122111201 |
4 | 1330011020332100233 |
5 | 4140323414140211 |
6 | 141112150030331 |
7 | 12424366136203 |
oct | 1740510762057 |
9 | 421801148451 |
10 | 133230224431 |
11 | 51558a965a7 |
12 | 219a26483a7 |
13 | c743196535 |
14 | 663c4c0b03 |
15 | 36eb7320c1 |
hex | 1f0523e42f |
133230224431 has 2 divisors, whose sum is σ = 133230224432. Its totient is φ = 133230224430.
The previous prime is 133230224383. The next prime is 133230224437. The reversal of 133230224431 is 134422032331.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 133230224431 - 213 = 133230216239 is a prime.
It is a super-2 number, since 2×1332302244312 (a number of 23 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 133230224431.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (133230224437) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 66615112215 + 66615112216.
It is an arithmetic number, because the mean of its divisors is an integer number (66615112216).
Almost surely, 2133230224431 is an apocalyptic number.
133230224431 is a deficient number, since it is larger than the sum of its proper divisors (1).
133230224431 is an equidigital number, since it uses as much as digits as its factorization.
133230224431 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 10368, while the sum is 28.
Adding to 133230224431 its reverse (134422032331), we get a palindrome (267652256762).
The spelling of 133230224431 in words is "one hundred thirty-three billion, two hundred thirty million, two hundred twenty-four thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •