Base | Representation |
---|---|
bin | 11100111010101… |
… | …100111110110011 |
3 | 1020210220012120100 |
4 | 130322230332303 |
5 | 1443144310033 |
6 | 120050243443 |
7 | 15010466235 |
oct | 3472547663 |
9 | 1223805510 |
10 | 485150643 |
11 | 22994494a |
12 | 116586583 |
13 | 796861b3 |
14 | 4860c255 |
15 | 2c8d3513 |
hex | 1ceacfb3 |
485150643 has 6 divisors (see below), whose sum is σ = 700773164. Its totient is φ = 323433756.
The previous prime is 485150587. The next prime is 485150683. The reversal of 485150643 is 346051584.
It is a happy number.
485150643 is a `hidden beast` number, since 4 + 8 + 5 + 1 + 5 + 0 + 643 = 666.
It is not a de Polignac number, because 485150643 - 210 = 485149619 is a prime.
It is a super-2 number, since 2×4851506432 = 470742292806626898, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 485150598 and 485150607.
It is not an unprimeable number, because it can be changed into a prime (485150683) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 26952805 + ... + 26952822.
Almost surely, 2485150643 is an apocalyptic number.
485150643 is a deficient number, since it is larger than the sum of its proper divisors (215622521).
485150643 is a wasteful number, since it uses less digits than its factorization.
485150643 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 53905633 (or 53905630 counting only the distinct ones).
The product of its (nonzero) digits is 57600, while the sum is 36.
The square root of 485150643 is about 22026.1354531384. The cubic root of 485150643 is about 785.7641378035.
The spelling of 485150643 in words is "four hundred eighty-five million, one hundred fifty thousand, six hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.148 sec. • engine limits •