Base | Representation |
---|---|
bin | 1011010101010… |
… | …0000111100110 |
3 | 10022102210112210 |
4 | 2311110013212 |
5 | 44131433340 |
6 | 4414424250 |
7 | 1115000541 |
oct | 265240746 |
9 | 108383483 |
10 | 47530470 |
11 | 24914389 |
12 | 13b02086 |
13 | 9b02350 |
14 | 6453858 |
15 | 428d180 |
hex | 2d541e6 |
47530470 has 128 divisors (see below), whose sum is σ = 133249536. Its totient is φ = 10745856.
The previous prime is 47530463. The next prime is 47530501. The reversal of 47530470 is 7403574.
47530470 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (30).
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, 444157 + ... + 444263.
It is an arithmetic number, because the mean of its divisors is an integer number (1041012).
Almost surely, 247530470 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 47530470, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (66624768).
47530470 is an abundant number, since it is smaller than the sum of its proper divisors (85719066).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
47530470 is a wasteful number, since it uses less digits than its factorization.
47530470 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 214.
The product of its (nonzero) digits is 11760, while the sum is 30.
The square root of 47530470 is about 6894.2345477943. The cubic root of 47530470 is about 362.2352438573.
The spelling of 47530470 in words is "forty-seven million, five hundred thirty thousand, four hundred seventy".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •