Base | Representation |
---|---|
bin | 1001100101100110… |
… | …00000111111101111 |
3 | 111021201100221002022 |
4 | 10302303000333233 |
5 | 41020140422034 |
6 | 2210430220355 |
7 | 241360330265 |
oct | 46263007757 |
9 | 14251327068 |
10 | 5147201519 |
11 | 2201508759 |
12 | bb79546bb |
13 | 6404baa95 |
14 | 36b85c435 |
15 | 201d31b2e |
hex | 132cc0fef |
5147201519 has 2 divisors, whose sum is σ = 5147201520. Its totient is φ = 5147201518.
The previous prime is 5147201513. The next prime is 5147201539. The reversal of 5147201519 is 9151027415.
It is a happy number.
5147201519 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-5147201519 is a prime.
It is a super-2 number, since 2×51472015192 = 52987366954391814722, which contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5147201513) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2573600759 + 2573600760.
It is an arithmetic number, because the mean of its divisors is an integer number (2573600760).
Almost surely, 25147201519 is an apocalyptic number.
5147201519 is a deficient number, since it is larger than the sum of its proper divisors (1).
5147201519 is an equidigital number, since it uses as much as digits as its factorization.
5147201519 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 12600, while the sum is 35.
The square root of 5147201519 is about 71743.9998815232. Note that the first 3 decimals coincide. The cubic root of 5147201519 is about 1726.5946487895.
The spelling of 5147201519 in words is "five billion, one hundred forty-seven million, two hundred one thousand, five hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.136 sec. • engine limits •