Base | Representation |
---|---|
bin | 1001111001100011… |
… | …01000101100110011 |
3 | 111201101101021010012 |
4 | 10330301220230303 |
5 | 41341020041034 |
6 | 2235210325135 |
7 | 245462312453 |
oct | 47461505463 |
9 | 14641337105 |
10 | 5314612019 |
11 | 2287a61742 |
12 | 1043a297ab |
13 | 6690a4552 |
14 | 385b99d63 |
15 | 21189ecce |
hex | 13cc68b33 |
5314612019 has 4 divisors (see below), whose sum is σ = 5314856880. Its totient is φ = 5314367160.
The previous prime is 5314611977. The next prime is 5314612027. The reversal of 5314612019 is 9102164135.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 9102164135 = 5 ⋅1820432827.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-5314612019 is a prime.
It is a super-2 number, since 2×53146120192 = 56490201824998512722, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (5314612049) 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 in 3 ways as a sum of consecutive naturals, for example, 86324 + ... + 134465.
It is an arithmetic number, because the mean of its divisors is an integer number (1328714220).
Almost surely, 25314612019 is an apocalyptic number.
5314612019 is a deficient number, since it is larger than the sum of its proper divisors (244861).
5314612019 is a wasteful number, since it uses less digits than its factorization.
5314612019 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 244860.
The product of its (nonzero) digits is 6480, while the sum is 32.
The square root of 5314612019 is about 72901.3855766816. The cubic root of 5314612019 is about 1745.1142109630.
The spelling of 5314612019 in words is "five billion, three hundred fourteen million, six hundred twelve thousand, nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •