Base | Representation |
---|---|
bin | 11100000000111… |
… | …101010111100000 |
3 | 1012202102011012000 |
4 | 130000331113200 |
5 | 1430310412113 |
6 | 114350004000 |
7 | 14435022324 |
oct | 3400752740 |
9 | 1182364160 |
10 | 470013408 |
11 | 221346037 |
12 | 1114a6600 |
13 | 764b6257 |
14 | 465cb984 |
15 | 2b3e3373 |
hex | 1c03d5e0 |
470013408 has 48 divisors (see below), whose sum is σ = 1370874960. Its totient is φ = 156670848.
The previous prime is 470013407. The next prime is 470013419. The reversal of 470013408 is 804310074.
It is a tau number, because it is divible by the number of its divisors (48).
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (470013407) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 271135 + ... + 272862.
It is an arithmetic number, because the mean of its divisors is an integer number (28559895).
Almost surely, 2470013408 is an apocalyptic number.
470013408 is a gapful number since it is divisible by the number (48) formed by its first and last digit.
It is an amenable number.
470013408 is an abundant number, since it is smaller than the sum of its proper divisors (900861552).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
470013408 is a wasteful number, since it uses less digits than its factorization.
470013408 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 544016 (or 544002 counting only the distinct ones).
The product of its (nonzero) digits is 2688, while the sum is 27.
The square root of 470013408 is about 21679.7926189343. The cubic root of 470013408 is about 777.5054030635.
The spelling of 470013408 in words is "four hundred seventy million, thirteen thousand, four hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.099 sec. • engine limits •