Base | Representation |
---|---|
bin | 101100101011001001… |
… | …010010011011000100 |
3 | 11120211000012001002001 |
4 | 230223021102123010 |
5 | 1241214413322200 |
6 | 34011511155044 |
7 | 3315463324345 |
oct | 545311223304 |
9 | 146730161061 |
10 | 47968495300 |
11 | 19385a68550 |
12 | 9368675a84 |
13 | 46a5c1483b |
14 | 24709d40cc |
15 | 13ab35c76a |
hex | b2b2526c4 |
47968495300 has 144 divisors (see below), whose sum is σ = 116936265600. Its totient is φ = 16928128000.
The previous prime is 47968495283. The next prime is 47968495307. The reversal of 47968495300 is 359486974.
It is a super-2 number, since 2×479684953002 (a number of 22 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (55).
It is not an unprimeable number, because it can be changed into a prime (47968495307) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 8882001 + ... + 8887399.
It is an arithmetic number, because the mean of its divisors is an integer number (812057400).
Almost surely, 247968495300 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 47968495300, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (58468132800).
47968495300 is an abundant number, since it is smaller than the sum of its proper divisors (68967770300).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
47968495300 is a wasteful number, since it uses less digits than its factorization.
47968495300 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5662 (or 5655 counting only the distinct ones).
The product of its (nonzero) digits is 6531840, while the sum is 55.
The spelling of 47968495300 in words is "forty-seven billion, nine hundred sixty-eight million, four hundred ninety-five thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •