Base | Representation |
---|---|
bin | 100110011110110000111… |
… | …1100111110000000010100 |
3 | 200201121011221122010012120 |
4 | 1030331201330332000110 |
5 | 1143122324004121230 |
6 | 15125341202415540 |
7 | 1054046052143124 |
oct | 114754174760024 |
9 | 20647157563176 |
10 | 5288748113940 |
11 | 1759a44484275 |
12 | 714bb30615b0 |
13 | 2c495aa45515 |
14 | 143d963aac84 |
15 | 9288c188310 |
hex | 4cf61f3e014 |
5288748113940 has 24 divisors (see below), whose sum is σ = 14808494719200. Its totient is φ = 1410332830368.
The previous prime is 5288748113911. The next prime is 5288748113953. The reversal of 5288748113940 is 493118478825.
It is a super-2 number, since 2×52887481139402 (a number of 26 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (60), and also a Moran number because the ratio is a prime number: 88145801899 = 5288748113940 / (5 + 2 + 8 + 8 + 7 + 4 + 8 + 1 + 1 + 3 + 9 + 4 + 0).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 44072900890 + ... + 44072901009.
It is an arithmetic number, because the mean of its divisors is an integer number (617020613300).
Almost surely, 25288748113940 is an apocalyptic number.
It is an amenable number.
5288748113940 is an abundant number, since it is smaller than the sum of its proper divisors (9519746605260).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5288748113940 is a wasteful number, since it uses less digits than its factorization.
5288748113940 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 88145801911 (or 88145801909 counting only the distinct ones).
The product of its (nonzero) digits is 15482880, while the sum is 60.
The spelling of 5288748113940 in words is "five trillion, two hundred eighty-eight billion, seven hundred forty-eight million, one hundred thirteen thousand, nine hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •