Base | Representation |
---|---|
bin | 101100100100100011… |
… | …110000001000001000 |
3 | 11120112022020220022122 |
4 | 230210203300020020 |
5 | 1241003121222300 |
6 | 33552522510412 |
7 | 3312652136024 |
oct | 544443601010 |
9 | 146468226278 |
10 | 47857992200 |
11 | 19329652977 |
12 | 9337665408 |
13 | 46890644a5 |
14 | 246006b384 |
15 | 13a17d0c85 |
hex | b248f0208 |
47857992200 has 108 divisors (see below), whose sum is σ = 115205839245. Its totient is φ = 18488548800.
The previous prime is 47857992199. The next prime is 47857992227. The reversal of 47857992200 is 229975874.
It is a powerful number, because all its prime factors have an exponent greater than 1 and also an Achilles number because it is not a perfect power.
It can be written as a sum of positive squares in 2 ways, for example, as 46900832356 + 957159844 = 216566^2 + 30938^2 .
It is an ABA number since it can be written as A⋅BA, here for A=2, B=154690.
It is an unprimeable number.
It is a polite number, since it can be written in 26 ways as a sum of consecutive naturals, for example, 95907551 + ... + 95908049.
Almost surely, 247857992200 is an apocalyptic number.
47857992200 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 47857992200
47857992200 is an abundant number, since it is smaller than the sum of its proper divisors (67347847045).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
47857992200 is an equidigital number, since it uses as much as digits as its factorization.
47857992200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1076 (or 537 counting only the distinct ones).
The product of its (nonzero) digits is 2540160, while the sum is 53.
The spelling of 47857992200 in words is "forty-seven billion, eight hundred fifty-seven million, nine hundred ninety-two thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •