Base | Representation |
---|---|
bin | 100100101011011000110… |
… | …0110000101011010000000 |
3 | 122211220122022001012112220 |
4 | 1021112301212011122000 |
5 | 1130042404401022211 |
6 | 14415443102251040 |
7 | 1030125042423153 |
oct | 111266146053200 |
9 | 18756568035486 |
10 | 5040976189056 |
11 | 1673958705915 |
12 | 694b84886a80 |
13 | 2a7492467a92 |
14 | 135dad863c9a |
15 | 8b1d9c84806 |
hex | 495b1985680 |
5040976189056 has 128 divisors (see below), whose sum is σ = 13447917700800. Its totient is φ = 1673083772928.
The previous prime is 5040976189019. The next prime is 5040976189087. The reversal of 5040976189056 is 6509816790405.
It is a tau number, because it is divible by the number of its divisors (128).
It is a super-2 number, since 2×50409761890562 (a number of 26 digits) contains 22 as substring.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 88632180 + ... + 88689036.
Almost surely, 25040976189056 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 5040976189056, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (6723958850400).
5040976189056 is an abundant number, since it is smaller than the sum of its proper divisors (8406941511744).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5040976189056 is a wasteful number, since it uses less digits than its factorization.
5040976189056 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 57866 (or 57854 counting only the distinct ones).
The product of its (nonzero) digits is 16329600, while the sum is 60.
The spelling of 5040976189056 in words is "five trillion, forty billion, nine hundred seventy-six million, one hundred eighty-nine thousand, fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •