Base | Representation |
---|---|
bin | 10101100010001110000010… |
… | …00001001011111101001000 |
3 | 20012200010011222121122110111 |
4 | 22301013001001023331020 |
5 | 22201332024201032300 |
6 | 244414411445124104 |
7 | 12655206210633451 |
oct | 1261070101137510 |
9 | 205603158548414 |
10 | 47355252752200 |
11 | 140a82826a2188 |
12 | 53899223b9634 |
13 | 2056772ab75b3 |
14 | b9a013a3a128 |
15 | 571c436a09ba |
hex | 2b11c104bf48 |
47355252752200 has 48 divisors (see below), whose sum is σ = 115895750166000. Its totient is φ = 17945148409920.
The previous prime is 47355252752183. The next prime is 47355252752209. The reversal of 47355252752200 is 225725255374.
It is a happy number.
It is not an unprimeable number, because it can be changed into a prime (47355252752209) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 6230950510 + ... + 6230958109.
It is an arithmetic number, because the mean of its divisors is an integer number (2414494795125).
Almost surely, 247355252752200 is an apocalyptic number.
47355252752200 is a gapful number since it is divisible by the number (40) formed by its first and last digit.
It is an amenable number.
47355252752200 is an abundant number, since it is smaller than the sum of its proper divisors (68540497413800).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
47355252752200 is a wasteful number, since it uses less digits than its factorization.
47355252752200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12461908654 (or 12461908645 counting only the distinct ones).
The product of its (nonzero) digits is 5880000, while the sum is 49.
The spelling of 47355252752200 in words is "forty-seven trillion, three hundred fifty-five billion, two hundred fifty-two million, seven hundred fifty-two thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •