Base | Representation |
---|---|
bin | 11111000011110000100… |
… | …101110100010111011101 |
3 | 21120001002211200100021121 |
4 | 133003300211310113131 |
5 | 234432112044140402 |
6 | 4312300302130541 |
7 | 310125640400056 |
oct | 37036045642735 |
9 | 7501084610247 |
10 | 2134340224477 |
11 | 75319446189a |
12 | 2a5796280a51 |
13 | 1263626a0166 |
14 | 7543455372d |
15 | 3a7bbdbd837 |
hex | 1f0f09745dd |
2134340224477 has 2 divisors, whose sum is σ = 2134340224478. Its totient is φ = 2134340224476.
The previous prime is 2134340224411. The next prime is 2134340224529. The reversal of 2134340224477 is 7744220434312.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2133603590596 + 736633881 = 1460686^2 + 27141^2 .
It is a cyclic number.
It is not a de Polignac number, because 2134340224477 - 223 = 2134331835869 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2134340224777) 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, 1067170112238 + 1067170112239.
It is an arithmetic number, because the mean of its divisors is an integer number (1067170112239).
Almost surely, 22134340224477 is an apocalyptic number.
It is an amenable number.
2134340224477 is a deficient number, since it is larger than the sum of its proper divisors (1).
2134340224477 is an equidigital number, since it uses as much as digits as its factorization.
2134340224477 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 903168, while the sum is 43.
Adding to 2134340224477 its reverse (7744220434312), we get a palindrome (9878560658789).
The spelling of 2134340224477 in words is "two trillion, one hundred thirty-four billion, three hundred forty million, two hundred twenty-four thousand, four hundred seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •