Base | Representation |
---|---|
bin | 11100111010001… |
… | …011101001111100 |
3 | 1020210122021022200 |
4 | 130322023221330 |
5 | 1443130423030 |
6 | 120043311500 |
7 | 15006360252 |
oct | 3472135174 |
9 | 1223567280 |
10 | 485014140 |
11 | 229861336 |
12 | 11651b590 |
13 | 79639020 |
14 | 485b45d2 |
15 | 2c8a7d60 |
hex | 1ce8ba7c |
485014140 has 144 divisors (see below), whose sum is σ = 1667920800. Its totient is φ = 113094144.
The previous prime is 485014129. The next prime is 485014151. The reversal of 485014140 is 41410584.
It is a happy number.
485014140 is a `hidden beast` number, since 485 + 0 + 141 + 40 = 666.
It is an interprime number because it is at equal distance from previous prime (485014129) and next prime (485014151).
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, 39006 + ... + 49914.
Almost surely, 2485014140 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 485014140, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (833960400).
485014140 is an abundant number, since it is smaller than the sum of its proper divisors (1182906660).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
485014140 is a wasteful number, since it uses less digits than its factorization.
485014140 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10956 (or 10951 counting only the distinct ones).
The product of its (nonzero) digits is 2560, while the sum is 27.
The square root of 485014140 is about 22023.0365753681. The cubic root of 485014140 is about 785.6904361435.
The spelling of 485014140 in words is "four hundred eighty-five million, fourteen thousand, one hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •