Base | Representation |
---|---|
bin | 100111100110000111010… |
… | …0100010110001000000000 |
3 | 201021020200002211102011100 |
4 | 1033030032210112020000 |
5 | 1203130122300112424 |
6 | 15324001112014400 |
7 | 1101112016355153 |
oct | 117141644261000 |
9 | 21236602742140 |
10 | 5441967972864 |
11 | 1808a2005a055 |
12 | 73a834091400 |
13 | 3062383c7637 |
14 | 14b56d635c9a |
15 | 96858789dc9 |
hex | 4f30e916200 |
5441967972864 has 240 divisors, whose sum is σ = 16473730470912. Its totient is φ = 1726123474944.
The previous prime is 5441967972767. The next prime is 5441967972893. The reversal of 5441967972864 is 4682797691445.
5441967972864 is a `hidden beast` number, since 5 + 4 + 419 + 67 + 9 + 72 + 86 + 4 = 666.
It is a Harshad number since it is a multiple of its sum of digits (72).
It is a junction number, because it is equal to n+sod(n) for n = 5441967972792 and 5441967972801.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 20321889 + ... + 20587935.
Almost surely, 25441967972864 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 5441967972864, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (8236865235456).
5441967972864 is an abundant number, since it is smaller than the sum of its proper divisors (11031762498048).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5441967972864 is a wasteful number, since it uses less digits than its factorization.
5441967972864 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 266287 (or 266268 counting only the distinct ones).
The product of its digits is 731566080, while the sum is 72.
The spelling of 5441967972864 in words is "five trillion, four hundred forty-one billion, nine hundred sixty-seven million, nine hundred seventy-two thousand, eight hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •