Base | Representation |
---|---|
bin | 11100101111010… |
… | …010100101100110 |
3 | 1020121021012201220 |
4 | 130233102211212 |
5 | 1441413041300 |
6 | 115502201210 |
7 | 14643166140 |
oct | 3457224546 |
9 | 1217235656 |
10 | 482158950 |
11 | 228191179 |
12 | 115583206 |
13 | 78b79570 |
14 | 4806dc90 |
15 | 2c4e1da0 |
hex | 1cbd2966 |
482158950 has 96 divisors (see below), whose sum is σ = 1471739136. Its totient is φ = 101727360.
The previous prime is 482158949. The next prime is 482158961. The reversal of 482158950 is 59851284.
It is a happy number.
It is a Smith number, since the sum of its digits (42) coincides with the sum of the digits of its prime factors.
It is a Harshad number since it is a multiple of its sum of digits (42).
It is a Curzon number.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 4012 + ... + 31311.
It is an arithmetic number, because the mean of its divisors is an integer number (15330616).
Almost surely, 2482158950 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 482158950, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (735869568).
482158950 is an abundant number, since it is smaller than the sum of its proper divisors (989580186).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
482158950 is a wasteful number, since it uses less digits than its factorization.
482158950 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 35358 (or 35353 counting only the distinct ones).
The product of its (nonzero) digits is 115200, while the sum is 42.
The square root of 482158950 is about 21958.1180887616. The cubic root of 482158950 is about 784.1456620145.
The spelling of 482158950 in words is "four hundred eighty-two million, one hundred fifty-eight thousand, nine hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.061 sec. • engine limits •