Base | Representation |
---|---|
bin | 111110000111101010… |
… | …1010110111100100111 |
3 | 110202022221222022110202 |
4 | 1330033111112330213 |
5 | 4141201204242211 |
6 | 141141135341115 |
7 | 12431543600651 |
oct | 1741725267447 |
9 | 422287868422 |
10 | 133401243431 |
11 | 51636584715 |
12 | 21a2b98179b |
13 | c76c744601 |
14 | 66570bb6d1 |
15 | 370b76453b |
hex | 1f0f556f27 |
133401243431 has 2 divisors, whose sum is σ = 133401243432. Its totient is φ = 133401243430.
The previous prime is 133401243361. The next prime is 133401243461. The reversal of 133401243431 is 134342104331.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 133401243431 - 210 = 133401242407 is a prime.
It is a super-2 number, since 2×1334012434312 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 133401243394 and 133401243403.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (133401243461) 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, 66700621715 + 66700621716.
It is an arithmetic number, because the mean of its divisors is an integer number (66700621716).
Almost surely, 2133401243431 is an apocalyptic number.
133401243431 is a deficient number, since it is larger than the sum of its proper divisors (1).
133401243431 is an equidigital number, since it uses as much as digits as its factorization.
133401243431 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 29.
Adding to 133401243431 its reverse (134342104331), we get a palindrome (267743347762).
The spelling of 133401243431 in words is "one hundred thirty-three billion, four hundred one million, two hundred forty-three thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •