Base | Representation |
---|---|
bin | 11100001010011… |
… | …101001111100110 |
3 | 1012221002122122010 |
4 | 130022131033212 |
5 | 1431430101040 |
6 | 114515215050 |
7 | 14465132361 |
oct | 3412351746 |
9 | 1187078563 |
10 | 472503270 |
11 | 222796778 |
12 | 1122a7486 |
13 | 76b78645 |
14 | 46a790d8 |
15 | 2b735e80 |
hex | 1c29d3e6 |
472503270 has 128 divisors (see below), whose sum is σ = 1254113280. Its totient is φ = 113438720.
The previous prime is 472503247. The next prime is 472503277. The reversal of 472503270 is 72305274.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is an alternating number because its digits alternate between even and odd.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (472503277) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 1233499 + ... + 1233881.
It is an arithmetic number, because the mean of its divisors is an integer number (9797760).
Almost surely, 2472503270 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 472503270, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (627056640).
472503270 is an abundant number, since it is smaller than the sum of its proper divisors (781610010).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
472503270 is a wasteful number, since it uses less digits than its factorization.
472503270 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 510.
The product of its (nonzero) digits is 11760, while the sum is 30.
The square root of 472503270 is about 21737.1403363000. The cubic root of 472503270 is about 778.8759120413.
The spelling of 472503270 in words is "four hundred seventy-two million, five hundred three thousand, two hundred seventy".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •