Base | Representation |
---|---|
bin | 101011001110011011100… |
… | …1111100110010101100000 |
3 | 210000221102012121220200112 |
4 | 1112130313033212111200 |
5 | 1234313343322401212 |
6 | 20345110233110452 |
7 | 1152133132650632 |
oct | 126346717462540 |
9 | 23027365556615 |
10 | 5940866606432 |
11 | 199056435965a |
12 | 7bb468258428 |
13 | 3412b53067a4 |
14 | 16777a482a52 |
15 | a4807867422 |
hex | 567373e6560 |
5940866606432 has 192 divisors, whose sum is σ = 12527763849216. Its totient is φ = 2768141537280.
The previous prime is 5940866606429. The next prime is 5940866606483. The reversal of 5940866606432 is 2346066680495.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 2270104388 + ... + 2270107004.
It is an arithmetic number, because the mean of its divisors is an integer number (65248770048).
Almost surely, 25940866606432 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 5940866606432, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (6263881924608).
5940866606432 is an abundant number, since it is smaller than the sum of its proper divisors (6586897242784).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5940866606432 is a wasteful number, since it uses less digits than its factorization.
5940866606432 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3309 (or 3301 counting only the distinct ones).
The product of its (nonzero) digits is 44789760, while the sum is 59.
The spelling of 5940866606432 in words is "five trillion, nine hundred forty billion, eight hundred sixty-six million, six hundred six thousand, four hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •