Base | Representation |
---|---|
bin | 1110000111111110110… |
… | …01111111111111110100 |
3 | 1201101200212201200020020 |
4 | 13003333121333333310 |
5 | 30422414230433324 |
6 | 1010541544405140 |
7 | 50030500231023 |
oct | 7037731777764 |
9 | 1641625650206 |
10 | 485321342964 |
11 | 177907278187 |
12 | 7a0851767b0 |
13 | 369c50632b3 |
14 | 196bd96a8ba |
15 | c957146679 |
hex | 70ff67fff4 |
485321342964 has 24 divisors (see below), whose sum is σ = 1199029200768. Its totient is φ = 152257676160.
The previous prime is 485321342951. The next prime is 485321342969. The reversal of 485321342964 is 469243123584.
It is a super-3 number, since 3×4853213429643 (a number of 36 digits) contains 333 as substring.
It is a Harshad number since it is a multiple of its sum of digits (51).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (485321342969) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1189512892 + ... + 1189513299.
It is an arithmetic number, because the mean of its divisors is an integer number (49959550032).
Almost surely, 2485321342964 is an apocalyptic number.
It is an amenable number.
485321342964 is an abundant number, since it is smaller than the sum of its proper divisors (713707857804).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
485321342964 is a wasteful number, since it uses less digits than its factorization.
485321342964 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2379026215 (or 2379026213 counting only the distinct ones).
The product of its digits is 4976640, while the sum is 51.
The spelling of 485321342964 in words is "four hundred eighty-five billion, three hundred twenty-one million, three hundred forty-two thousand, nine hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •