Base | Representation |
---|---|
bin | 100111010111101100110… |
… | …1001010110101010000000 |
3 | 201011021202221221211210210 |
4 | 1032233121221112222000 |
5 | 1202123224410302430 |
6 | 15301441445154120 |
7 | 1065635001233223 |
oct | 116573151265200 |
9 | 21137687854723 |
10 | 5411015322240 |
11 | 17a68870a2560 |
12 | 7348360bb940 |
13 | 303344863158 |
14 | 149c748875ba |
15 | 95b461d42b0 |
hex | 4ebd9a56a80 |
5411015322240 has 256 divisors, whose sum is σ = 19096410493440. Its totient is φ = 1292182425600.
The previous prime is 5411015322217. The next prime is 5411015322259. The reversal of 5411015322240 is 422235101145.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a junction number, because it is equal to n+sod(n) for n = 5411015322198 and 5411015322207.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 496926 + ... + 3327005.
It is an arithmetic number, because the mean of its divisors is an integer number (74595353490).
Almost surely, 25411015322240 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 5411015322240, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (9548205246720).
5411015322240 is an abundant number, since it is smaller than the sum of its proper divisors (13685395171200).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5411015322240 is a wasteful number, since it uses less digits than its factorization.
5411015322240 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3824031 (or 3824019 counting only the distinct ones).
The product of its (nonzero) digits is 9600, while the sum is 30.
The spelling of 5411015322240 in words is "five trillion, four hundred eleven billion, fifteen million, three hundred twenty-two thousand, two hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •