Base | Representation |
---|---|
bin | 11100111011100… |
… | …110001010100111 |
3 | 1020211100002212110 |
4 | 130323212022213 |
5 | 1443224303441 |
6 | 120055252103 |
7 | 15012463146 |
oct | 3473461247 |
9 | 1224302773 |
10 | 485384871 |
11 | 229a94924 |
12 | 11667a033 |
13 | 797389aa |
14 | 4866d75d |
15 | 2c92cb16 |
hex | 1cee62a7 |
485384871 has 4 divisors (see below), whose sum is σ = 647179832. Its totient is φ = 323589912.
The previous prime is 485384843. The next prime is 485384899. The reversal of 485384871 is 178483584.
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 (485384843) and next prime (485384899).
It is not a de Polignac number, because 485384871 - 27 = 485384743 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 485384871.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (485484871) 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 3 ways as a sum of consecutive naturals, for example, 80897476 + ... + 80897481.
It is an arithmetic number, because the mean of its divisors is an integer number (161794958).
Almost surely, 2485384871 is an apocalyptic number.
485384871 is a deficient number, since it is larger than the sum of its proper divisors (161794961).
485384871 is a wasteful number, since it uses less digits than its factorization.
485384871 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 161794960.
The product of its digits is 860160, while the sum is 48.
The square root of 485384871 is about 22031.4518586497. The cubic root of 485384871 is about 785.8905716263.
The spelling of 485384871 in words is "four hundred eighty-five million, three hundred eighty-four thousand, eight hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •