Base | Representation |
---|---|
bin | 100110100100011110100… |
… | …1000000000101100001011 |
3 | 200202202211212020021212002 |
4 | 1031020331020000230023 |
5 | 1143322434334402134 |
6 | 15135130331541215 |
7 | 1054662045230456 |
oct | 115107510005413 |
9 | 20682755207762 |
10 | 5301015153419 |
11 | 1764169947627 |
12 | 7174572ba80b |
13 | 2c5b6430746b |
14 | 1447db65c49d |
15 | 92d590a687e |
hex | 4d23d200b0b |
5301015153419 has 2 divisors, whose sum is σ = 5301015153420. Its totient is φ = 5301015153418.
The previous prime is 5301015153359. The next prime is 5301015153461. The reversal of 5301015153419 is 9143515101035.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 5301015153419 - 212 = 5301015149323 is a prime.
It is a super-2 number, since 2×53010151534192 (a number of 26 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (5301015143419) 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, 2650507576709 + 2650507576710.
It is an arithmetic number, because the mean of its divisors is an integer number (2650507576710).
Almost surely, 25301015153419 is an apocalyptic number.
5301015153419 is a deficient number, since it is larger than the sum of its proper divisors (1).
5301015153419 is an equidigital number, since it uses as much as digits as its factorization.
5301015153419 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 40500, while the sum is 38.
The spelling of 5301015153419 in words is "five trillion, three hundred one billion, fifteen million, one hundred fifty-three thousand, four hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •