Base | Representation |
---|---|
bin | 100101110111111000100… |
… | …0000101100110011000000 |
3 | 200102121122202002221121212 |
4 | 1023233301000230303000 |
5 | 1140240322203404000 |
6 | 15023131444305252 |
7 | 1045031630344460 |
oct | 113576100546300 |
9 | 20377582087555 |
10 | 5205248888000 |
11 | 1727596329a27 |
12 | 70098b3a2228 |
13 | 2b9b11985515 |
14 | 13dd149d5ba0 |
15 | 906018b1c35 |
hex | 4bbf102ccc0 |
5205248888000 has 112 divisors (see below), whose sum is σ = 14732341725504. Its totient is φ = 1784656742400.
The previous prime is 5205248887939. The next prime is 5205248888069. The reversal of 5205248888000 is 8888425025.
It is a tau number, because it is divible by the number of its divisors (112).
It is a Harshad number since it is a multiple of its sum of digits (50).
It is a self number, because there is not a number n which added to its sum of digits gives 5205248888000.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 46419437 + ... + 46531436.
Almost surely, 25205248888000 is an apocalyptic number.
5205248888000 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
It is an amenable number.
5205248888000 is an abundant number, since it is smaller than the sum of its proper divisors (9527092837504).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5205248888000 is an equidigital number, since it uses as much as digits as its factorization.
5205248888000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 92950907 (or 92950887 counting only the distinct ones).
The product of its (nonzero) digits is 1638400, while the sum is 50.
The spelling of 5205248888000 in words is "five trillion, two hundred five billion, two hundred forty-eight million, eight hundred eighty-eight thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.096 sec. • engine limits •