Base | Representation |
---|---|
bin | 100100101010111100010… |
… | …1100010010100011001000 |
3 | 122211211011202122201011210 |
4 | 1021111320230102203020 |
5 | 1130033431001430230 |
6 | 14415204240253120 |
7 | 1030062301010223 |
oct | 111257054224310 |
9 | 18754152581153 |
10 | 5040021514440 |
11 | 167350882a730 |
12 | 6949590111a0 |
13 | 2a736c73a363 |
14 | 135d1cb545ba |
15 | 8b181057eb0 |
hex | 49578b128c8 |
5040021514440 has 64 divisors (see below), whose sum is σ = 16494615869760. Its totient is φ = 1221823397120.
The previous prime is 5040021514397. The next prime is 5040021514453. The reversal of 5040021514440 is 444151200405.
It is a super-2 number, since 2×50400215144402 (a number of 26 digits) contains 22 as substring.
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 = 5040021514398 and 5040021514407.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1909097739 + ... + 1909100378.
It is an arithmetic number, because the mean of its divisors is an integer number (257728372965).
Almost surely, 25040021514440 is an apocalyptic number.
It is an amenable number.
5040021514440 is an abundant number, since it is smaller than the sum of its proper divisors (11454594355320).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5040021514440 is a wasteful number, since it uses less digits than its factorization.
5040021514440 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3818198142 (or 3818198138 counting only the distinct ones).
The product of its (nonzero) digits is 12800, while the sum is 30.
Adding to 5040021514440 its reverse (444151200405), we get a palindrome (5484172714845).
The spelling of 5040021514440 in words is "five trillion, forty billion, twenty-one million, five hundred fourteen thousand, four hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •