Base | Representation |
---|---|
bin | 1001100111101000… |
… | …00010001001000101 |
3 | 111022220102212010120 |
4 | 10303310002021011 |
5 | 41034021324243 |
6 | 2212235412153 |
7 | 241655235354 |
oct | 46364021105 |
9 | 14286385116 |
10 | 5164245573 |
11 | 221009a153 |
12 | 10015b4059 |
13 | 643ba7916 |
14 | 36dc1799b |
15 | 20359bc83 |
hex | 133d02245 |
5164245573 has 8 divisors (see below), whose sum is σ = 6886950336. Its totient is φ = 3442185600.
The previous prime is 5164245571. The next prime is 5164245599. The reversal of 5164245573 is 3755424615.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 5164245573 - 21 = 5164245571 is a prime.
It is a Smith number, since the sum of its digits (42) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5164245571) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 142188 + ... + 174773.
It is an arithmetic number, because the mean of its divisors is an integer number (860868792).
Almost surely, 25164245573 is an apocalyptic number.
It is an amenable number.
5164245573 is a deficient number, since it is larger than the sum of its proper divisors (1722704763).
5164245573 is a wasteful number, since it uses less digits than its factorization.
5164245573 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 322395.
The product of its digits is 504000, while the sum is 42.
The square root of 5164245573 is about 71862.6855398544. The cubic root of 5164245573 is about 1728.4983207732.
The spelling of 5164245573 in words is "five billion, one hundred sixty-four million, two hundred forty-five thousand, five hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •