Base | Representation |
---|---|
bin | 1110001001001110100… |
… | …01100100101011100101 |
3 | 1201110102111100021112210 |
4 | 13010213101210223211 |
5 | 30430301444110230 |
6 | 1011132201034033 |
7 | 50053201506231 |
oct | 7044721445345 |
9 | 1643374307483 |
10 | 485990222565 |
11 | 17811a8a1341 |
12 | 7a231185919 |
13 | 36aa07c7743 |
14 | 197447235c1 |
15 | c995c1ceb0 |
hex | 7127464ae5 |
485990222565 has 16 divisors (see below), whose sum is σ = 777647752128. Its totient is φ = 259173653376.
The previous prime is 485990222563. The next prime is 485990222629. The reversal of 485990222565 is 565222099584.
It is a happy number.
It is not a de Polignac number, because 485990222565 - 21 = 485990222563 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (485990222563) 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 15 ways as a sum of consecutive naturals, for example, 1129744 + ... + 1499433.
It is an arithmetic number, because the mean of its divisors is an integer number (48602984508).
Almost surely, 2485990222565 is an apocalyptic number.
It is an amenable number.
485990222565 is a deficient number, since it is larger than the sum of its proper divisors (291657529563).
485990222565 is a wasteful number, since it uses less digits than its factorization.
485990222565 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2641508.
The product of its (nonzero) digits is 15552000, while the sum is 57.
The spelling of 485990222565 in words is "four hundred eighty-five billion, nine hundred ninety million, two hundred twenty-two thousand, five hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •