Base | Representation |
---|---|
bin | 101100001111100101… |
… | …100100000011011100 |
3 | 11112121210012020101101 |
4 | 230033211210003130 |
5 | 1234243033124000 |
6 | 33453553322444 |
7 | 3301150400632 |
oct | 541745440334 |
9 | 145553166341 |
10 | 47506145500 |
11 | 19168a87280 |
12 | 9259866424 |
13 | 46311b2888 |
14 | 242943d352 |
15 | 138097ee6a |
hex | b0f9640dc |
47506145500 has 48 divisors (see below), whose sum is σ = 113185564128. Its totient is φ = 17274960000.
The previous prime is 47506145497. The next prime is 47506145503. The reversal of 47506145500 is 554160574.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (47506145497) and next prime (47506145503).
It is a self number, because there is not a number n which added to its sum of digits gives 47506145500.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (47506145503) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 4313241 + ... + 4324240.
It is an arithmetic number, because the mean of its divisors is an integer number (2358032586).
Almost surely, 247506145500 is an apocalyptic number.
It is an amenable number.
47506145500 is an abundant number, since it is smaller than the sum of its proper divisors (65679418628).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
47506145500 is a wasteful number, since it uses less digits than its factorization.
47506145500 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8637511 (or 8637499 counting only the distinct ones).
The product of its (nonzero) digits is 84000, while the sum is 37.
The spelling of 47506145500 in words is "forty-seven billion, five hundred six million, one hundred forty-five thousand, five hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.375 sec. • engine limits •