Base | Representation |
---|---|
bin | 1110001000000111101… |
… | …10100111110001110110 |
3 | 1201101220002010100102210 |
4 | 13010003312213301312 |
5 | 30423042331023211 |
6 | 1010553211514250 |
7 | 50032364353200 |
oct | 7040366476166 |
9 | 1641802110383 |
10 | 485395954806 |
11 | 1779453a9164 |
12 | 7a0a6158986 |
13 | 36a07658009 |
14 | 196c982d770 |
15 | c95d9839a6 |
hex | 7103da7c76 |
485395954806 has 144 divisors (see below), whose sum is σ = 1169603064000. Its totient is φ = 133899242400.
The previous prime is 485395954801. The next prime is 485395954891. The reversal of 485395954806 is 608459593584.
It is a Smith number, since the sum of its digits (66) coincides with the sum of the digits of its prime factors.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (485395954801) by changing a digit.
It is a polite number, since it can be written in 71 ways as a sum of consecutive naturals, for example, 138722445 + ... + 138725943.
It is an arithmetic number, because the mean of its divisors is an integer number (8122243500).
Almost surely, 2485395954806 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 485395954806, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (584801532000).
485395954806 is an abundant number, since it is smaller than the sum of its proper divisors (684207109194).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
485395954806 is a wasteful number, since it uses less digits than its factorization.
485395954806 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4071 (or 4033 counting only the distinct ones).
The product of its (nonzero) digits is 186624000, while the sum is 66.
The spelling of 485395954806 in words is "four hundred eighty-five billion, three hundred ninety-five million, nine hundred fifty-four thousand, eight hundred six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •