Base | Representation |
---|---|
bin | 10101110100000110110110… |
… | …00001101110010111000000 |
3 | 20021211212121200022120021220 |
4 | 22322003123001232113000 |
5 | 22241414243033032224 |
6 | 250005015341315040 |
7 | 13050465040304250 |
oct | 1272033301562700 |
9 | 207755550276256 |
10 | 47969869424064 |
11 | 143149a8799685 |
12 | 5468a70265a80 |
13 | 209c701a38b63 |
14 | bbba7b23d960 |
15 | 582c16864279 |
hex | 2ba0db06e5c0 |
47969869424064 has 448 divisors, whose sum is σ = 152202743193600. Its totient is φ = 13044874752000.
The previous prime is 47969869424003. The next prime is 47969869424117. The reversal of 47969869424064 is 46042496896974.
It is a tau number, because it is divible by the number of its divisors (448).
It is a super-2 number, since 2×479698694240642 (a number of 28 digits) contains 22 as substring.
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, 770953147 + ... + 771015365.
Almost surely, 247969869424064 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 47969869424064, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (76101371596800).
47969869424064 is an abundant number, since it is smaller than the sum of its proper divisors (104232873769536).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
47969869424064 is a wasteful number, since it uses less digits than its factorization.
47969869424064 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 62552 (or 62542 counting only the distinct ones).
The product of its (nonzero) digits is 4514807808, while the sum is 78.
The spelling of 47969869424064 in words is "forty-seven trillion, nine hundred sixty-nine billion, eight hundred sixty-nine million, four hundred twenty-four thousand, sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •