Base | Representation |
---|---|
bin | 1110001010000111001… |
… | …10000110101011110100 |
3 | 1201111122121102002212101 |
4 | 13011003212012223310 |
5 | 30432240113214042 |
6 | 1011251253031444 |
7 | 50101031251300 |
oct | 7050346065364 |
9 | 1644577362771 |
10 | 486465366772 |
11 | 178344021200 |
12 | 7a344325584 |
13 | 36b48089168 |
14 | 1978b888d00 |
15 | c9c27c66b7 |
hex | 7143986af4 |
486465366772 has 216 divisors, whose sum is σ = 1123704338400. Its totient is φ = 183503295360.
The previous prime is 486465366743. The next prime is 486465366773. The reversal of 486465366772 is 277663564684.
It is a happy number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (486465366773) 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 71 ways as a sum of consecutive naturals, for example, 93746754 + ... + 93751942.
It is an arithmetic number, because the mean of its divisors is an integer number (5202334900).
Almost surely, 2486465366772 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 486465366772, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (561852169200).
486465366772 is an abundant number, since it is smaller than the sum of its proper divisors (637238971628).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
486465366772 is a wasteful number, since it uses less digits than its factorization.
486465366772 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5355 (or 5335 counting only the distinct ones).
The product of its digits is 243855360, while the sum is 64.
The spelling of 486465366772 in words is "four hundred eighty-six billion, four hundred sixty-five million, three hundred sixty-six thousand, seven hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •