Base | Representation |
---|---|
bin | 11100111010001… |
… | …010010101011111 |
3 | 1020210121222220111 |
4 | 130322022111133 |
5 | 1443130234420 |
6 | 120043230451 |
7 | 15006335431 |
oct | 3472122537 |
9 | 1223558814 |
10 | 485008735 |
11 | 229858272 |
12 | 116518427 |
13 | 79636723 |
14 | 485b2651 |
15 | 2c8a645a |
hex | 1ce8a55f |
485008735 has 4 divisors (see below), whose sum is σ = 582010488. Its totient is φ = 388006984.
The previous prime is 485008717. The next prime is 485008753. The reversal of 485008735 is 537800584.
It is a semiprime because it is the product of two primes.
It is an interprime number because it is at equal distance from previous prime (485008717) and next prime (485008753).
It is a cyclic number.
It is not a de Polignac number, because 485008735 - 25 = 485008703 is a prime.
It is a Smith number, since the sum of its digits (40) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a Duffinian number.
It is a congruent number.
It is an unprimeable number.
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 3 ways as a sum of consecutive naturals, for example, 48500869 + ... + 48500878.
It is an arithmetic number, because the mean of its divisors is an integer number (145502622).
Almost surely, 2485008735 is an apocalyptic number.
485008735 is a deficient number, since it is larger than the sum of its proper divisors (97001753).
485008735 is an equidigital number, since it uses as much as digits as its factorization.
485008735 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 97001752.
The product of its (nonzero) digits is 134400, while the sum is 40.
The square root of 485008735 is about 22022.9138626114. The cubic root of 485008735 is about 785.6875175532.
The spelling of 485008735 in words is "four hundred eighty-five million, eight thousand, seven hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •