Base | Representation |
---|---|
bin | 100100111110001010000… |
… | …0010000010010000010101 |
3 | 122222202200022021022102112 |
4 | 1021330110002002100111 |
5 | 1131222431242422023 |
6 | 14450150420120405 |
7 | 1033052625445205 |
oct | 111742402022025 |
9 | 18882608238375 |
10 | 5081282389013 |
11 | 1689a61492476 |
12 | 6a0953236105 |
13 | 2ab216aa913c |
14 | 137d1497a405 |
15 | 8c2985a2478 |
hex | 49f14082415 |
5081282389013 has 2 divisors, whose sum is σ = 5081282389014. Its totient is φ = 5081282389012.
The previous prime is 5081282388887. The next prime is 5081282389031. The reversal of 5081282389013 is 3109832821805.
It is a happy number.
Together with next prime (5081282389031) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 4209481096804 + 871801292209 = 2051702^2 + 933703^2 .
It is a cyclic number.
It is not a de Polignac number, because 5081282389013 - 232 = 5076987421717 is a prime.
It is a super-2 number, since 2×50812823890132 (a number of 26 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5081282389213) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2540641194506 + 2540641194507.
It is an arithmetic number, because the mean of its divisors is an integer number (2540641194507).
Almost surely, 25081282389013 is an apocalyptic number.
It is an amenable number.
5081282389013 is a deficient number, since it is larger than the sum of its proper divisors (1).
5081282389013 is an equidigital number, since it uses as much as digits as its factorization.
5081282389013 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 829440, while the sum is 50.
The spelling of 5081282389013 in words is "five trillion, eighty-one billion, two hundred eighty-two million, three hundred eighty-nine thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •