Base | Representation |
---|---|
bin | 1110000111110000011… |
… | …10111110111010111011 |
3 | 1201101101111022100112221 |
4 | 13003320032332322323 |
5 | 30422142424430314 |
6 | 1010522005344511 |
7 | 50024506401040 |
oct | 7037016767273 |
9 | 1641344270487 |
10 | 485201014459 |
11 | 177855361637 |
12 | 7a050a08137 |
13 | 369a61529b5 |
14 | 196ab9a71c7 |
15 | c94b7c8824 |
hex | 70f83beebb |
485201014459 has 8 divisors (see below), whose sum is σ = 554534193920. Its totient is φ = 415872522216.
The previous prime is 485201014423. The next prime is 485201014469. The reversal of 485201014459 is 954410102584.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 485201014459 - 213 = 485201006267 is a prime.
It is not an unprimeable number, because it can be changed into a prime (485201014469) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 947109 + ... + 1366534.
It is an arithmetic number, because the mean of its divisors is an integer number (69316774240).
Almost surely, 2485201014459 is an apocalyptic number.
485201014459 is a deficient number, since it is larger than the sum of its proper divisors (69333179461).
485201014459 is a wasteful number, since it uses less digits than its factorization.
485201014459 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2343609.
The product of its (nonzero) digits is 230400, while the sum is 43.
The spelling of 485201014459 in words is "four hundred eighty-five billion, two hundred one million, fourteen thousand, four hundred fifty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •