Base | Representation |
---|---|
bin | 1110001000100100001… |
… | …10101010110100000000 |
3 | 1201102111202000021011210 |
4 | 13010102012222310000 |
5 | 30424040032330220 |
6 | 1011033032210120 |
7 | 50041326516063 |
oct | 7042206526400 |
9 | 1642452007153 |
10 | 485635042560 |
11 | 177a58359348 |
12 | 7a152239940 |
13 | 36a45049865 |
14 | 1970d4a88da |
15 | c97495e6e0 |
hex | 71121aad00 |
485635042560 has 216 divisors, whose sum is σ = 1584726657696. Its totient is φ = 126745088000.
The previous prime is 485635042559. The next prime is 485635042573. The reversal of 485635042560 is 65240536584.
It is a super-2 number, since 2×4856350425602 (a number of 24 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (48).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 8453935 + ... + 8511185.
Almost surely, 2485635042560 is an apocalyptic number.
485635042560 is a gapful number since it is divisible by the number (40) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 485635042560, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (792363328848).
485635042560 is an abundant number, since it is smaller than the sum of its proper divisors (1099091615136).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
485635042560 is an equidigital number, since it uses as much as digits as its factorization.
485635042560 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 57369 (or 57308 counting only the distinct ones).
The product of its (nonzero) digits is 3456000, while the sum is 48.
The spelling of 485635042560 in words is "four hundred eighty-five billion, six hundred thirty-five million, forty-two thousand, five hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •