Base | Representation |
---|---|
bin | 11100111010101… |
… | …110100010101101 |
3 | 1020210220112100011 |
4 | 130322232202231 |
5 | 1443200011122 |
6 | 120050333221 |
7 | 15010524001 |
oct | 3472564255 |
9 | 1223815304 |
10 | 485157037 |
11 | 229949732 |
12 | 11658a211 |
13 | 79689091 |
14 | 48610701 |
15 | 2c8d5377 |
hex | 1ceae8ad |
485157037 has 8 divisors (see below), whose sum is σ = 518077440. Its totient is φ = 453316080.
The previous prime is 485157019. The next prime is 485157047. The reversal of 485157037 is 730751584.
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 485157037 - 223 = 476768429 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (485157007) 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 7 ways as a sum of consecutive naturals, for example, 268933 + ... + 270730.
It is an arithmetic number, because the mean of its divisors is an integer number (64759680).
Almost surely, 2485157037 is an apocalyptic number.
It is an amenable number.
485157037 is a deficient number, since it is larger than the sum of its proper divisors (32920403).
485157037 is a wasteful number, since it uses less digits than its factorization.
485157037 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 539723.
The product of its (nonzero) digits is 117600, while the sum is 40.
The square root of 485157037 is about 22026.2805984124. The cubic root of 485157037 is about 785.7675897580.
The spelling of 485157037 in words is "four hundred eighty-five million, one hundred fifty-seven thousand, thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •