Base | Representation |
---|---|
bin | 10000001001010100110… |
… | …100001011001100000000 |
3 | 10221001212200010210220110 |
4 | 100021110310023030000 |
5 | 121134301234311244 |
6 | 2205413013111320 |
7 | 143106023601261 |
oct | 20112464131400 |
9 | 3831780123813 |
10 | 1109524525824 |
11 | 398601740240 |
12 | 15b049628540 |
13 | 80821119a80 |
14 | 3b9b641a968 |
15 | 1dcdbc3c9b9 |
hex | 10254d0b300 |
1109524525824 has 288 divisors, whose sum is σ = 3486882034944. Its totient is φ = 308775075840.
The previous prime is 1109524525819. The next prime is 1109524525831. The reversal of 1109524525824 is 4285254259011.
It is a Harshad number since it is a multiple of its sum of digits (48).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 21609687 + ... + 21660969.
It is an arithmetic number, because the mean of its divisors is an integer number (12107229288).
Almost surely, 21109524525824 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 1109524525824, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1743441017472).
1109524525824 is an abundant number, since it is smaller than the sum of its proper divisors (2377357509120).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1109524525824 is a wasteful number, since it uses less digits than its factorization.
1109524525824 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 51523 (or 51509 counting only the distinct ones).
The product of its (nonzero) digits is 1152000, while the sum is 48.
The spelling of 1109524525824 in words is "one trillion, one hundred nine billion, five hundred twenty-four million, five hundred twenty-five thousand, eight hundred twenty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •