Base | Representation |
---|---|
bin | 11100001000100… |
… | …010110100101110 |
3 | 1012220011011210120 |
4 | 130020202310232 |
5 | 1431313024323 |
6 | 114500345410 |
7 | 14460643440 |
oct | 3410426456 |
9 | 1186134716 |
10 | 472001838 |
11 | 222483a70 |
12 | 1120a5266 |
13 | 76a31339 |
14 | 46988490 |
15 | 2b6875e3 |
hex | 1c222d2e |
472001838 has 128 divisors (see below), whose sum is σ = 1312174080. Its totient is φ = 109278720.
The previous prime is 472001779. The next prime is 472001851. The reversal of 472001838 is 838100274.
It is a Harshad number since it is a multiple of its sum of digits (33).
It is a junction number, because it is equal to n+sod(n) for n = 472001799 and 472001808.
It is a congruent number.
It is an unprimeable number.
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 63 ways as a sum of consecutive naturals, for example, 147645 + ... + 150807.
It is an arithmetic number, because the mean of its divisors is an integer number (10251360).
Almost surely, 2472001838 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 472001838, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (656087040).
472001838 is an abundant number, since it is smaller than the sum of its proper divisors (840172242).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
472001838 is a wasteful number, since it uses less digits than its factorization.
472001838 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3222.
The product of its (nonzero) digits is 10752, while the sum is 33.
The square root of 472001838 is about 21725.6032827629. The cubic root of 472001838 is about 778.6002938128.
The spelling of 472001838 in words is "four hundred seventy-two million, one thousand, eight hundred thirty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •