Base | Representation |
---|---|
bin | 11100111100110… |
… | …100011101001110 |
3 | 1020211221101202110 |
4 | 130330310131032 |
5 | 1443320034200 |
6 | 120110204450 |
7 | 15015300111 |
oct | 3474643516 |
9 | 1224841673 |
10 | 485705550 |
11 | 22a193850 |
12 | 1167b3726 |
13 | 7981b945 |
14 | 48714578 |
15 | 2c992b50 |
hex | 1cf3474e |
485705550 has 96 divisors (see below), whose sum is σ = 1383304320. Its totient is φ = 111542400.
The previous prime is 485705503. The next prime is 485705587. The reversal of 485705550 is 55507584.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 485705499 and 485705508.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 23604 + ... + 39096.
It is an arithmetic number, because the mean of its divisors is an integer number (14409420).
Almost surely, 2485705550 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 485705550, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (691652160).
485705550 is an abundant number, since it is smaller than the sum of its proper divisors (897598770).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
485705550 is a wasteful number, since it uses less digits than its factorization.
485705550 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15538 (or 15533 counting only the distinct ones).
The product of its (nonzero) digits is 140000, while the sum is 39.
The square root of 485705550 is about 22038.7284115940. The cubic root of 485705550 is about 786.0636048471.
The spelling of 485705550 in words is "four hundred eighty-five million, seven hundred five thousand, five hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •