Base | Representation |
---|---|
bin | 100100110111110101100… |
… | …1100011010001111110101 |
3 | 122221110122120211110001222 |
4 | 1021233223030122033311 |
5 | 1131012133324402411 |
6 | 14440024103000125 |
7 | 1032062431110023 |
oct | 111575314321765 |
9 | 18843576743058 |
10 | 5067712340981 |
11 | 1684228557544 |
12 | 69a1a6739045 |
13 | 2a9b63597a14 |
14 | 1373c8623713 |
15 | 8bc5209c4db |
hex | 49beb31a3f5 |
5067712340981 has 2 divisors, whose sum is σ = 5067712340982. Its totient is φ = 5067712340980.
The previous prime is 5067712340941. The next prime is 5067712341017. The reversal of 5067712340981 is 1890432177605.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 5002312462225 + 65399878756 = 2236585^2 + 255734^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-5067712340981 is a prime.
It is a super-2 number, since 2×50677123409812 (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 (5067712340921) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2533856170490 + 2533856170491.
It is an arithmetic number, because the mean of its divisors is an integer number (2533856170491).
It is a 1-persistent number, because it is pandigital, but 2⋅5067712340981 = 10135424681962 is not.
Almost surely, 25067712340981 is an apocalyptic number.
It is an amenable number.
5067712340981 is a deficient number, since it is larger than the sum of its proper divisors (1).
5067712340981 is an equidigital number, since it uses as much as digits as its factorization.
5067712340981 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2540160, while the sum is 53.
The spelling of 5067712340981 in words is "five trillion, sixty-seven billion, seven hundred twelve million, three hundred forty thousand, nine hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •