Base | Representation |
---|---|
bin | 11100001010100… |
… | …100100000001000 |
3 | 1012221011011102020 |
4 | 130022210200020 |
5 | 1431432024000 |
6 | 114520004440 |
7 | 14465315142 |
oct | 3412444010 |
9 | 1187134366 |
10 | 472533000 |
11 | 222807045 |
12 | 112300720 |
13 | 76b89034 |
14 | 46a85c92 |
15 | 2b73eba0 |
hex | 1c2a4808 |
472533000 has 128 divisors (see below), whose sum is σ = 1522160640. Its totient is φ = 121920000.
The previous prime is 472532993. The next prime is 472533029. The reversal of 472533000 is 335274.
It is a Harshad number since it is a multiple of its sum of digits (24).
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, 90460 + ... + 95540.
It is an arithmetic number, because the mean of its divisors is an integer number (11891880).
Almost surely, 2472533000 is an apocalyptic number.
472533000 is a gapful number since it is divisible by the number (40) 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 472533000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (761080320).
472533000 is an abundant number, since it is smaller than the sum of its proper divisors (1049627640).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
472533000 is a wasteful number, since it uses less digits than its factorization.
472533000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5136 (or 5122 counting only the distinct ones).
The product of its (nonzero) digits is 2520, while the sum is 24.
The square root of 472533000 is about 21737.8241781463. The cubic root of 472533000 is about 778.8922473746.
Adding to 472533000 its reverse (335274), we get a palindrome (472868274).
The spelling of 472533000 in words is "four hundred seventy-two million, five hundred thirty-three thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •