Base | Representation |
---|---|
bin | 101010101011110001100… |
… | …1000101101101100001100 |
3 | 202202211022100212000000000 |
4 | 1111113203020231230030 |
5 | 1232103432403240442 |
6 | 20251001131404300 |
7 | 1143556610231460 |
oct | 125274310555414 |
9 | 22684270760000 |
10 | 5866441071372 |
11 | 1961a420575a2 |
12 | 7a8b572b3690 |
13 | 33728405854b |
14 | 163d19bc64a0 |
15 | a28ed976d4c |
hex | 555e322db0c |
5866441071372 has 240 divisors, whose sum is σ = 18525322717440. Its totient is φ = 1587906027072.
The previous prime is 5866441071331. The next prime is 5866441071437. The reversal of 5866441071372 is 2731701446685.
5866441071372 is a `hidden beast` number, since 5 + 8 + 66 + 441 + 0 + 7 + 137 + 2 = 666.
It is a Harshad number since it is a multiple of its sum of digits (54).
It is an unprimeable number.
It is a polite number, since it can be written in 79 ways as a sum of consecutive naturals, for example, 10191238 + ... + 10751474.
It is an arithmetic number, because the mean of its divisors is an integer number (77188844656).
Almost surely, 25866441071372 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 5866441071372, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (9262661358720).
5866441071372 is an abundant number, since it is smaller than the sum of its proper divisors (12658881646068).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5866441071372 is an equidigital number, since it uses as much as digits as its factorization.
5866441071372 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 560294 (or 560268 counting only the distinct ones).
The product of its (nonzero) digits is 6773760, while the sum is 54.
The spelling of 5866441071372 in words is "five trillion, eight hundred sixty-six billion, four hundred forty-one million, seventy-one thousand, three hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •