Base | Representation |
---|---|
bin | 101001110001100111101… |
… | …0110111101010100010000 |
3 | 202022212221212001220000000 |
4 | 1103203033112331110100 |
5 | 1223032201113200423 |
6 | 20113344542130000 |
7 | 1131546043020000 |
oct | 123431726752420 |
9 | 22285855056000 |
10 | 5741555209488 |
11 | 1913a8626309a |
12 | 788903280900 |
13 | 328570866357 |
14 | 15bc6da10000 |
15 | 9e53eab3843 |
hex | 538cf5bd510 |
5741555209488 has 800 divisors, whose sum is σ = 20000194072320. Its totient is φ = 1595243849472.
The previous prime is 5741555209487. The next prime is 5741555209541. The reversal of 5741555209488 is 8849025551475.
5741555209488 is a `hidden beast` number, since 5 + 7 + 4 + 15 + 5 + 520 + 94 + 8 + 8 = 666.
It is a Harshad number since it is a multiple of its sum of digits (63).
It is not an unprimeable number, because it can be changed into a prime (5741555209487) by changing a digit.
It is a polite number, since it can be written in 159 ways as a sum of consecutive naturals, for example, 3108583381 + ... + 3108585227.
Almost surely, 25741555209488 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 5741555209488, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (10000097036160).
5741555209488 is an abundant number, since it is smaller than the sum of its proper divisors (14258638862832).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5741555209488 is an frugal number, since it uses more digits than its factorization.
5741555209488 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1941 (or 1896 counting only the distinct ones).
The product of its (nonzero) digits is 80640000, while the sum is 63.
The spelling of 5741555209488 in words is "five trillion, seven hundred forty-one billion, five hundred fifty-five million, two hundred nine thousand, four hundred eighty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •