Base | Representation |
---|---|
bin | 11100100000001… |
… | …100000101000100 |
3 | 1020022211002021000 |
4 | 130200030011010 |
5 | 1434404401012 |
6 | 115241253300 |
7 | 14564430324 |
oct | 3440140504 |
9 | 1208732230 |
10 | 478200132 |
11 | 225a27923 |
12 | 114194230 |
13 | 780c1677 |
14 | 4771d284 |
15 | 2beadddc |
hex | 1c80c144 |
478200132 has 96 divisors (see below), whose sum is σ = 1329955200. Its totient is φ = 148127616.
The previous prime is 478200077. The next prime is 478200139. The reversal of 478200132 is 231002874.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a junction number, because it is equal to n+sod(n) for n = 478200096 and 478200105.
It is not an unprimeable number, because it can be changed into a prime (478200139) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 106558 + ... + 110954.
It is an arithmetic number, because the mean of its divisors is an integer number (13853700).
Almost surely, 2478200132 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 478200132, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (664977600).
478200132 is an abundant number, since it is smaller than the sum of its proper divisors (851755068).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
478200132 is a wasteful number, since it uses less digits than its factorization.
478200132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4482 (or 4474 counting only the distinct ones).
The product of its (nonzero) digits is 2688, while the sum is 27.
The square root of 478200132 is about 21867.7875424104. The cubic root of 478200132 is about 781.9936573248.
The spelling of 478200132 in words is "four hundred seventy-eight million, two hundred thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •