Base | Representation |
---|---|
bin | 10101011010110110011101… |
… | …10011110110000000000000 |
3 | 20011202220201000102101101110 |
4 | 22231123032303312000000 |
5 | 22133210030223034320 |
6 | 244102221453203320 |
7 | 12631004323044225 |
oct | 1255331663660000 |
9 | 204686630371343 |
10 | 47102081064960 |
11 | 1400a9758a3409 |
12 | 5348847790540 |
13 | 20389268c0bbc |
14 | b8ba77ccd94c |
15 | 56a3771cc5e0 |
hex | 2ad6cecf6000 |
47102081064960 has 896 divisors, whose sum is σ = 164287570636800. Its totient is φ = 11478258155520.
The previous prime is 47102081064959. The next prime is 47102081064979. The reversal of 47102081064960 is 6946018020174.
It is a Harshad number since it is a multiple of its sum of digits (48).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 10066695901 + ... + 10066700579.
Almost surely, 247102081064960 is an apocalyptic number.
47102081064960 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 47102081064960, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (82143785318400).
47102081064960 is an abundant number, since it is smaller than the sum of its proper divisors (117185489571840).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
47102081064960 is a wasteful number, since it uses less digits than its factorization.
47102081064960 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4870 (or 4846 counting only the distinct ones).
The product of its (nonzero) digits is 580608, while the sum is 48.
The spelling of 47102081064960 in words is "forty-seven trillion, one hundred two billion, eighty-one million, sixty-four thousand, nine hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •