Base | Representation |
---|---|
bin | 11100010010110… |
… | …001101101011100 |
3 | 1020002012110101020 |
4 | 130102301231130 |
5 | 1433004344002 |
6 | 115034044140 |
7 | 14522515050 |
oct | 3422615534 |
9 | 1202173336 |
10 | 474684252 |
11 | 223a46339 |
12 | 112b79650 |
13 | 77460273 |
14 | 47085c60 |
15 | 2ba172bc |
hex | 1c4b1b5c |
474684252 has 96 divisors (see below), whose sum is σ = 1292928000. Its totient is φ = 132751872.
The previous prime is 474684241. The next prime is 474684283. The reversal of 474684252 is 252486474.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (42).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1220074 + ... + 1220462.
It is an arithmetic number, because the mean of its divisors is an integer number (13468000).
Almost surely, 2474684252 is an apocalyptic number.
474684252 is a gapful number since it is divisible by the number (42) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 474684252, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (646464000).
474684252 is an abundant number, since it is smaller than the sum of its proper divisors (818243748).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
474684252 is a wasteful number, since it uses less digits than its factorization.
474684252 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 675 (or 673 counting only the distinct ones).
The product of its digits is 430080, while the sum is 42.
The square root of 474684252 is about 21787.2497575991. The cubic root of 474684252 is about 780.0724521785.
The spelling of 474684252 in words is "four hundred seventy-four million, six hundred eighty-four thousand, two hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 1.002 sec. • engine limits •