Base | Representation |
---|---|
bin | 11100010000011… |
… | …100001100110000 |
3 | 1020001001100022220 |
4 | 130100130030300 |
5 | 1432330244411 |
6 | 115013001040 |
7 | 14514354456 |
oct | 3420341460 |
9 | 1201040286 |
10 | 474071856 |
11 | 223668225 |
12 | 112923180 |
13 | 772a75bb |
14 | 46d669d6 |
15 | 2b945b06 |
hex | 1c41c330 |
474071856 has 80 divisors (see below), whose sum is σ = 1253919744. Its totient is φ = 154282752.
The previous prime is 474071849. The next prime is 474071863. The reversal of 474071856 is 658170474.
It is an interprime number because it is at equal distance from previous prime (474071849) and next prime (474071863).
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 an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 780705 + ... + 781311.
Almost surely, 2474071856 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 474071856, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (626959872).
474071856 is an abundant number, since it is smaller than the sum of its proper divisors (779847888).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
474071856 is a wasteful number, since it uses less digits than its factorization.
474071856 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 978 (or 972 counting only the distinct ones).
The product of its (nonzero) digits is 188160, while the sum is 42.
The square root of 474071856 is about 21773.1912222347. The cubic root of 474071856 is about 779.7368474550.
The spelling of 474071856 in words is "four hundred seventy-four million, seventy-one thousand, eight hundred fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •