Base | Representation |
---|---|
bin | 1110000111101000101… |
… | …10111101000010101010 |
3 | 1201101012221222000200200 |
4 | 13003310112331002222 |
5 | 30422024303320200 |
6 | 1010511324013030 |
7 | 50023056630060 |
oct | 7036426750252 |
9 | 1641187860620 |
10 | 485135995050 |
11 | 177821692593 |
12 | 7a033091176 |
13 | 36995839185 |
14 | 196a30c0030 |
15 | c945c33800 |
hex | 70f45bd0aa |
485135995050 has 576 divisors, whose sum is σ = 1609243144704. Its totient is φ = 102369484800.
The previous prime is 485135995033. The next prime is 485135995061. The reversal of 485135995050 is 50599531584.
485135995050 is a `hidden beast` number, since 4 + 85 + 1 + 3 + 59 + 9 + 505 + 0 = 666.
485135995050 is digitally balanced in base 4, because in such base it contains all the possibile digits an equal number of times.
It is a Curzon number.
It is an unprimeable number.
It is a polite number, since it can be written in 287 ways as a sum of consecutive naturals, for example, 367248390 + ... + 367249710.
It is an arithmetic number, because the mean of its divisors is an integer number (2793824904).
Almost surely, 2485135995050 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 485135995050, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (804621572352).
485135995050 is an abundant number, since it is smaller than the sum of its proper divisors (1124107149654).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
485135995050 is a wasteful number, since it uses less digits than its factorization.
485135995050 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1543 (or 1535 counting only the distinct ones).
The product of its (nonzero) digits is 4860000, while the sum is 54.
The spelling of 485135995050 in words is "four hundred eighty-five billion, one hundred thirty-five million, nine hundred ninety-five thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •