Base | Representation |
---|---|
bin | 101100101011110100… |
… | …000011010111110000 |
3 | 11120211210021121001020 |
4 | 230223310003113300 |
5 | 1241230301041330 |
6 | 34012551335440 |
7 | 3315660525213 |
oct | 545364032760 |
9 | 146753247036 |
10 | 47979705840 |
11 | 19391325160 |
12 | 9370381580 |
13 | 46a833b3b1 |
14 | 24722b177a |
15 | 13ac324210 |
hex | b2bd035f0 |
47979705840 has 160 divisors (see below), whose sum is σ = 162415604736. Its totient is φ = 11620193280.
The previous prime is 47979705821. The next prime is 47979705853. The reversal of 47979705840 is 4850797974.
47979705840 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (60).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 2903682 + ... + 2920158.
Almost surely, 247979705840 is an apocalyptic number.
47979705840 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 47979705840, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (81207802368).
47979705840 is an abundant number, since it is smaller than the sum of its proper divisors (114435898896).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
47979705840 is a wasteful number, since it uses less digits than its factorization.
47979705840 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 17607 (or 17601 counting only the distinct ones).
The product of its (nonzero) digits is 17781120, while the sum is 60.
The spelling of 47979705840 in words is "forty-seven billion, nine hundred seventy-nine million, seven hundred five thousand, eight hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •