Base | Representation |
---|---|
bin | 1001011011101110… |
… | …00011000111000011 |
3 | 111001221111210021100 |
4 | 10231313003013003 |
5 | 40332434411200 |
6 | 2154311025443 |
7 | 236333312625 |
oct | 45567030703 |
9 | 14057453240 |
10 | 5064372675 |
11 | 216978516a |
12 | b9406b283 |
13 | 6292a9c2b |
14 | 36085ac15 |
15 | 1e991ed00 |
hex | 12ddc31c3 |
5064372675 has 72 divisors (see below), whose sum is σ = 9767656080. Its totient is φ = 2498918400.
The previous prime is 5064372661. The next prime is 5064372679. The reversal of 5064372675 is 5762734605.
5064372675 is a `hidden beast` number, since 506 + 4 + 3 + 72 + 6 + 75 = 666.
It is not a de Polignac number, because 5064372675 - 29 = 5064372163 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (45).
It is a self number, because there is not a number n which added to its sum of digits gives 5064372675.
It is not an unprimeable number, because it can be changed into a prime (5064372679) 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 71 ways as a sum of consecutive naturals, for example, 214455 + ... + 236895.
It is an arithmetic number, because the mean of its divisors is an integer number (135661890).
Almost surely, 25064372675 is an apocalyptic number.
5064372675 is a deficient number, since it is larger than the sum of its proper divisors (4703283405).
5064372675 is a wasteful number, since it uses less digits than its factorization.
5064372675 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22533 (or 22525 counting only the distinct ones).
The product of its (nonzero) digits is 1058400, while the sum is 45.
The square root of 5064372675 is about 71164.4059555056. The cubic root of 5064372675 is about 1717.2830589880.
The spelling of 5064372675 in words is "five billion, sixty-four million, three hundred seventy-two thousand, six hundred seventy-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •