Base | Representation |
---|---|
bin | 11100111101110… |
… | …101000001101011 |
3 | 1020212102211112220 |
4 | 130331311001223 |
5 | 1443402020102 |
6 | 120120005123 |
7 | 15020451144 |
oct | 3475650153 |
9 | 1225384486 |
10 | 485970027 |
11 | 22a354524 |
12 | 1169007a3 |
13 | 798b213a |
14 | 48782acb |
15 | 2c9e61bc |
hex | 1cf7506b |
485970027 has 8 divisors (see below), whose sum is σ = 649508160. Its totient is φ = 323205960.
The previous prime is 485970019. The next prime is 485970029. The reversal of 485970027 is 720079584.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 485970027 - 23 = 485970019 is a prime.
It is a Smith number, since the sum of its digits (42) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is not an unprimeable number, because it can be changed into a prime (485970029) 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, 192049 + ... + 194562.
It is an arithmetic number, because the mean of its divisors is an integer number (81188520).
Almost surely, 2485970027 is an apocalyptic number.
485970027 is a deficient number, since it is larger than the sum of its proper divisors (163538133).
485970027 is a wasteful number, since it uses less digits than its factorization.
485970027 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 387033.
The product of its (nonzero) digits is 141120, while the sum is 42.
The square root of 485970027 is about 22044.7278731220. The cubic root of 485970027 is about 786.2062550740.
It can be divided in two parts, 4859700 and 27, that multiplied together give a triangular number (131211900 = T16199).
The spelling of 485970027 in words is "four hundred eighty-five million, nine hundred seventy thousand, twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •