Base | Representation |
---|---|
bin | 111101001100001101… |
… | …1100000000101101001 |
3 | 110120011221020222202122 |
4 | 1322120123200011221 |
5 | 4123110012140113 |
6 | 140211154241025 |
7 | 12331241446646 |
oct | 1723033400551 |
9 | 416157228678 |
10 | 131406365033 |
11 | 50802515a89 |
12 | 21573886175 |
13 | c5123714a8 |
14 | 6508196dcd |
15 | 3641564408 |
hex | 1e986e0169 |
131406365033 has 2 divisors, whose sum is σ = 131406365034. Its totient is φ = 131406365032.
The previous prime is 131406365017. The next prime is 131406365039. The reversal of 131406365033 is 330563604131.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 78021338329 + 53385026704 = 279323^2 + 231052^2 .
It is a cyclic number.
It is not a de Polignac number, because 131406365033 - 24 = 131406365017 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 131406364984 and 131406365002.
It is not a weakly prime, because it can be changed into another prime (131406365039) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 65703182516 + 65703182517.
It is an arithmetic number, because the mean of its divisors is an integer number (65703182517).
Almost surely, 2131406365033 is an apocalyptic number.
It is an amenable number.
131406365033 is a deficient number, since it is larger than the sum of its proper divisors (1).
131406365033 is an equidigital number, since it uses as much as digits as its factorization.
131406365033 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 58320, while the sum is 35.
Adding to 131406365033 its reverse (330563604131), we get a palindrome (461969969164).
The spelling of 131406365033 in words is "one hundred thirty-one billion, four hundred six million, three hundred sixty-five thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •