Base | Representation |
---|---|
bin | 1001011100111111… |
… | …10110001010011001 |
3 | 111002200122010212122 |
4 | 10232133312022121 |
5 | 40343204130140 |
6 | 2155332151025 |
7 | 236523235202 |
oct | 45637661231 |
9 | 14080563778 |
10 | 5075067545 |
11 | 217481a3a9 |
12 | b97768475 |
13 | 62b582b62 |
14 | 3620425a9 |
15 | 1ea833ab5 |
hex | 12e7f6299 |
5075067545 has 8 divisors (see below), whose sum is σ = 6448321224. Its totient is φ = 3821227264.
The previous prime is 5075067533. The next prime is 5075067551. The reversal of 5075067545 is 5457605705.
It can be written as a sum of positive squares in 4 ways, for example, as 1778814976 + 3296252569 = 42176^2 + 57413^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 5075067545 - 214 = 5075051161 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 5075067496 and 5075067505.
It is an unprimeable number.
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 in 7 ways as a sum of consecutive naturals, for example, 29853254 + ... + 29853423.
It is an arithmetic number, because the mean of its divisors is an integer number (806040153).
Almost surely, 25075067545 is an apocalyptic number.
It is an amenable number.
5075067545 is a deficient number, since it is larger than the sum of its proper divisors (1373253679).
5075067545 is a wasteful number, since it uses less digits than its factorization.
5075067545 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 59706699.
The product of its (nonzero) digits is 735000, while the sum is 44.
The square root of 5075067545 is about 71239.5083152600. The cubic root of 5075067545 is about 1718.4910536702.
The spelling of 5075067545 in words is "five billion, seventy-five million, sixty-seven thousand, five hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •