Base | Representation |
---|---|
bin | 1011011000010… |
… | …0111010001000 |
3 | 10022210221200100 |
4 | 2312010322020 |
5 | 44204332222 |
6 | 4423005400 |
7 | 1116462300 |
oct | 266047210 |
9 | 108727610 |
10 | 47730312 |
11 | 24a40543 |
12 | 13b99860 |
13 | 9b722b6 |
14 | 64a6600 |
15 | 42cc4ac |
hex | 2d84e88 |
47730312 has 144 divisors (see below), whose sum is σ = 153120240. Its totient is φ = 13390272.
The previous prime is 47730311. The next prime is 47730329. The reversal of 47730312 is 21303774.
It is not an unprimeable number, because it can be changed into a prime (47730311) 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 35 ways as a sum of consecutive naturals, for example, 292743 + ... + 292905.
It is an arithmetic number, because the mean of its divisors is an integer number (1063335).
Almost surely, 247730312 is an apocalyptic number.
47730312 is a gapful number since it is divisible by the number (42) 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 47730312, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (76560120).
47730312 is an abundant number, since it is smaller than the sum of its proper divisors (105389928).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
47730312 is a wasteful number, since it uses less digits than its factorization.
47730312 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 272 (or 258 counting only the distinct ones).
The product of its (nonzero) digits is 3528, while the sum is 27.
The square root of 47730312 is about 6908.7127599865. The cubic root of 47730312 is about 362.7422070574.
The spelling of 47730312 in words is "forty-seven million, seven hundred thirty thousand, three hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •