Base | Representation |
---|---|
bin | 101100000011101000… |
… | …001010010101100000 |
3 | 11112002210122101111120 |
4 | 230003220022111200 |
5 | 1233340202000000 |
6 | 33422025012240 |
7 | 3263163054423 |
oct | 540350122540 |
9 | 145083571446 |
10 | 47305500000 |
11 | 190757a3350 |
12 | 9202624080 |
13 | 45cb760825 |
14 | 240a92d9ba |
15 | 136d0496a0 |
hex | b03a0a560 |
47305500000 has 672 divisors, whose sum is σ = 175767750144. Its totient is φ = 11040000000.
The previous prime is 47305499993. The next prime is 47305500019. The reversal of 47305500000 is 550374.
It is a Harshad number since it is a multiple of its sum of digits (24).
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 111 ways as a sum of consecutive naturals, for example, 775499970 + ... + 775500030.
It is an arithmetic number, because the mean of its divisors is an integer number (261559152).
Almost surely, 247305500000 is an apocalyptic number.
47305500000 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 47305500000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (87883875072).
47305500000 is an abundant number, since it is smaller than the sum of its proper divisors (128462250144).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
47305500000 is an equidigital number, since it uses as much as digits as its factorization.
47305500000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 162 (or 129 counting only the distinct ones).
The product of its (nonzero) digits is 2100, while the sum is 24.
The spelling of 47305500000 in words is "forty-seven billion, three hundred five million, five hundred thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •