Base | Representation |
---|---|
bin | 100101011110010110010… |
… | …0110011010011011100011 |
3 | 200020101010012200211011021 |
4 | 1022330230212122123203 |
5 | 1133341021444231024 |
6 | 14542022331430311 |
7 | 1041051030064213 |
oct | 112745446323343 |
9 | 20211105624137 |
10 | 5150414055139 |
11 | 1706307510441 |
12 | 6b22272b5397 |
13 | 2b48b3366562 |
14 | 13b3d211a243 |
15 | 8de9283dde4 |
hex | 4af2c99a6e3 |
5150414055139 has 2 divisors, whose sum is σ = 5150414055140. Its totient is φ = 5150414055138.
The previous prime is 5150414055103. The next prime is 5150414055151. The reversal of 5150414055139 is 9315504140515.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 5150414055139 - 211 = 5150414053091 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 5150414055095 and 5150414055104.
It is not a weakly prime, because it can be changed into another prime (5150414055439) 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, 2575207027569 + 2575207027570.
It is an arithmetic number, because the mean of its divisors is an integer number (2575207027570).
Almost surely, 25150414055139 is an apocalyptic number.
5150414055139 is a deficient number, since it is larger than the sum of its proper divisors (1).
5150414055139 is an equidigital number, since it uses as much as digits as its factorization.
5150414055139 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 270000, while the sum is 43.
The spelling of 5150414055139 in words is "five trillion, one hundred fifty billion, four hundred fourteen million, fifty-five thousand, one hundred thirty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •