Base | Representation |
---|---|
bin | 1110000111100000011… |
… | …10011110101010000000 |
3 | 1201101001010111200011100 |
4 | 13003300032132222000 |
5 | 30421404031231301 |
6 | 1010500410014400 |
7 | 50021255422314 |
oct | 7036016365200 |
9 | 1641033450140 |
10 | 485066664576 |
11 | 17779653957a |
12 | 7a013a17400 |
13 | 36984373320 |
14 | 19697bd3b44 |
15 | c93eadb286 |
hex | 70f039ea80 |
485066664576 has 96 divisors (see below), whose sum is σ = 1503201428820. Its totient is φ = 149251276800.
The previous prime is 485066664571. The next prime is 485066664581. The reversal of 485066664576 is 675466660584.
It is an interprime number because it is at equal distance from previous prime (485066664571) and next prime (485066664581).
It can be written as a sum of positive squares in 2 ways, for example, as 429758913600 + 55307750976 = 655560^2 + 235176^2 .
It is a tau number, because it is divible by the number of its divisors (96).
It is not an unprimeable number, because it can be changed into a prime (485066664571) 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 11 ways as a sum of consecutive naturals, for example, 16179825 + ... + 16209776.
Almost surely, 2485066664576 is an apocalyptic number.
It is an amenable number.
485066664576 is an abundant number, since it is smaller than the sum of its proper divisors (1018134764244).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
485066664576 is a wasteful number, since it uses less digits than its factorization.
485066664576 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 32389634 (or 32389619 counting only the distinct ones).
The product of its (nonzero) digits is 174182400, while the sum is 63.
The spelling of 485066664576 in words is "four hundred eighty-five billion, sixty-six million, six hundred sixty-four thousand, five hundred seventy-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •