Base | Representation |
---|---|
bin | 100110100101111000001… |
… | …0111110101100111101000 |
3 | 200210001121102221110121110 |
4 | 1031023300113311213220 |
5 | 1143400114220032130 |
6 | 15140345000110320 |
7 | 1055126422504344 |
oct | 115136027654750 |
9 | 20701542843543 |
10 | 5304022424040 |
11 | 176547242354a |
12 | 717b564653a0 |
13 | 2c6223366132 |
14 | 144a04bd8624 |
15 | 92e830d4ab0 |
hex | 4d2f05f59e8 |
5304022424040 has 64 divisors (see below), whose sum is σ = 15913170705600. Its totient is φ = 1414307896832.
The previous prime is 5304022424021. The next prime is 5304022424087. The reversal of 5304022424040 is 404242204035.
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 = 5304022423989 and 5304022424007.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 213379 + ... + 3263981.
It is an arithmetic number, because the mean of its divisors is an integer number (248643292275).
Almost surely, 25304022424040 is an apocalyptic number.
It is an amenable number.
5304022424040 is an abundant number, since it is smaller than the sum of its proper divisors (10609148281560).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5304022424040 is a wasteful number, since it uses less digits than its factorization.
5304022424040 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3065106 (or 3065102 counting only the distinct ones).
The product of its (nonzero) digits is 30720, while the sum is 30.
Adding to 5304022424040 its reverse (404242204035), we get a palindrome (5708264628075).
The spelling of 5304022424040 in words is "five trillion, three hundred four billion, twenty-two million, four hundred twenty-four thousand, forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •