Base | Representation |
---|---|
bin | 1001010100001101… |
… | …00101000110110011 |
3 | 110220112220011010202 |
4 | 10222012211012303 |
5 | 40220320211334 |
6 | 2144135545415 |
7 | 234636435146 |
oct | 45206450663 |
9 | 13815804122 |
10 | 5001335219 |
11 | 213713a1a1 |
12 | b76b2b26b |
13 | 61920856a |
14 | 35632c05d |
15 | 1e411c17e |
hex | 12a1a51b3 |
5001335219 has 2 divisors, whose sum is σ = 5001335220. Its totient is φ = 5001335218.
The previous prime is 5001335167. The next prime is 5001335221. The reversal of 5001335219 is 9125331005.
5001335219 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-5001335219 is a prime.
It is a super-2 number, since 2×50013352192 = 50026707945619555922, which contains 22 as substring.
Together with 5001335221, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 5001335191 and 5001335200.
It is not a weakly prime, because it can be changed into another prime (5001395219) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2500667609 + 2500667610.
It is an arithmetic number, because the mean of its divisors is an integer number (2500667610).
Almost surely, 25001335219 is an apocalyptic number.
5001335219 is a deficient number, since it is larger than the sum of its proper divisors (1).
5001335219 is an equidigital number, since it uses as much as digits as its factorization.
5001335219 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4050, while the sum is 29.
The square root of 5001335219 is about 70720.1189125131. The cubic root of 5001335219 is about 1710.1281459544.
The spelling of 5001335219 in words is "five billion, one million, three hundred thirty-five thousand, two hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •