Base | Representation |
---|---|
bin | 11001100010000000010111… |
… | …00100110111011001000000 |
3 | 21100210022111100201111011122 |
4 | 30301000023210313121000 |
5 | 24324330411204104002 |
6 | 315224111155531412 |
7 | 14553161552640356 |
oct | 1461001344673100 |
9 | 240708440644148 |
10 | 56144006706752 |
11 | 169865a3129778 |
12 | 63691022b9b68 |
13 | 2543484774053 |
14 | dc1554c037d6 |
15 | 67567b4666a2 |
hex | 33100b937640 |
56144006706752 has 112 divisors (see below), whose sum is σ = 119473475251200. Its totient is φ = 26100105638400.
The previous prime is 56144006706737. The next prime is 56144006706779. The reversal of 56144006706752 is 25760760044165.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 56144006706694 and 56144006706703.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 13398149 + ... + 17082107.
It is an arithmetic number, because the mean of its divisors is an integer number (1066727457600).
Almost surely, 256144006706752 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 56144006706752, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (59736737625600).
56144006706752 is an abundant number, since it is smaller than the sum of its proper divisors (63329468544448).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
56144006706752 is a wasteful number, since it uses less digits than its factorization.
56144006706752 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3684224 (or 3684214 counting only the distinct ones).
The product of its (nonzero) digits is 8467200, while the sum is 53.
The spelling of 56144006706752 in words is "fifty-six trillion, one hundred forty-four billion, six million, seven hundred six thousand, seven hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.106 sec. • engine limits •