Base | Representation |
---|---|
bin | 11100010000100… |
… | …110001010001010 |
3 | 1020001010102021210 |
4 | 130100212022022 |
5 | 1432333101100 |
6 | 115013513550 |
7 | 14514614424 |
oct | 3420461212 |
9 | 1201112253 |
10 | 474112650 |
11 | 223695940 |
12 | 1129428b6 |
13 | 772c003b |
14 | 46d77814 |
15 | 2b952c50 |
hex | 1c42628a |
474112650 has 48 divisors (see below), whose sum is σ = 1282694688. Its totient is φ = 114936000.
The previous prime is 474112649. The next prime is 474112651. The reversal of 474112650 is 56211474.
It is an interprime number because it is at equal distance from previous prime (474112649) and next prime (474112651).
It is a Harshad number since it is a multiple of its sum of digits (30).
It is not an unprimeable number, because it can be changed into a prime (474112651) by changing a digit.
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 23 ways as a sum of consecutive naturals, for example, 142021 + ... + 145320.
It is an arithmetic number, because the mean of its divisors is an integer number (26722806).
Almost surely, 2474112650 is an apocalyptic number.
474112650 is an abundant number, since it is smaller than the sum of its proper divisors (808582038).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
474112650 is a wasteful number, since it uses less digits than its factorization.
474112650 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 287367 (or 287362 counting only the distinct ones).
The product of its (nonzero) digits is 6720, while the sum is 30.
The square root of 474112650 is about 21774.1279963171. The cubic root of 474112650 is about 779.7592123295.
It can be divided in two parts, 4741 and 12650, that added together give a triangular number (17391 = T186).
The spelling of 474112650 in words is "four hundred seventy-four million, one hundred twelve thousand, six hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •