Base | Representation |
---|---|
bin | 1001100110001000… |
… | …10000001001111001 |
3 | 111022000212111100120 |
4 | 10303010100021321 |
5 | 41022320020212 |
6 | 2211111123453 |
7 | 241443620001 |
oct | 46304201171 |
9 | 14260774316 |
10 | 5151720057 |
11 | 2204014590 |
12 | bb9373589 |
13 | 641410683 |
14 | 36c2b7001 |
15 | 20242588c |
hex | 133110279 |
5151720057 has 8 divisors (see below), whose sum is σ = 7493411040. Its totient is φ = 3122254560.
The previous prime is 5151720053. The next prime is 5151720071. The reversal of 5151720057 is 7500271515.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 5151720057 - 22 = 5151720053 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (33), and also a Moran number because the ratio is a prime number: 156112729 = 5151720057 / (5 + 1 + 5 + 1 + 7 + 2 + 0 + 0 + 5 + 7).
It is not an unprimeable number, because it can be changed into a prime (5151720053) 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, 78056332 + ... + 78056397.
It is an arithmetic number, because the mean of its divisors is an integer number (936676380).
Almost surely, 25151720057 is an apocalyptic number.
It is an amenable number.
5151720057 is a deficient number, since it is larger than the sum of its proper divisors (2341690983).
5151720057 is a wasteful number, since it uses less digits than its factorization.
5151720057 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 156112743.
The product of its (nonzero) digits is 12250, while the sum is 33.
The square root of 5151720057 is about 71775.4836765312. The cubic root of 5151720057 is about 1727.0997388971.
The spelling of 5151720057 in words is "five billion, one hundred fifty-one million, seven hundred twenty thousand, fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •