Base | Representation |
---|---|
bin | 10000011000100100111… |
… | …100111011101101101111 |
3 | 10222122011000002102200222 |
4 | 100120210330323231233 |
5 | 121421321223301214 |
6 | 2221122034041555 |
7 | 144225612602150 |
oct | 20304474735557 |
9 | 3878130072628 |
10 | 1125901384559 |
11 | 3a4545a85636 |
12 | 16225a1192bb |
13 | 82230ca1423 |
14 | 3c6cb44b927 |
15 | 1e44987538e |
hex | 10624f3bb6f |
1125901384559 has 8 divisors (see below), whose sum is σ = 1305949580928. Its totient is φ = 950654473560.
The previous prime is 1125901384523. The next prime is 1125901384589. The reversal of 1125901384559 is 9554831095211.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1125901384559 - 212 = 1125901380463 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1125901384559.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1125901384589) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 1200320837 + ... + 1200321774.
It is an arithmetic number, because the mean of its divisors is an integer number (163243697616).
Almost surely, 21125901384559 is an apocalyptic number.
1125901384559 is a deficient number, since it is larger than the sum of its proper divisors (180048196369).
1125901384559 is an equidigital number, since it uses as much as digits as its factorization.
1125901384559 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2400642685.
The product of its (nonzero) digits is 1944000, while the sum is 53.
The spelling of 1125901384559 in words is "one trillion, one hundred twenty-five billion, nine hundred one million, three hundred eighty-four thousand, five hundred fifty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.243 sec. • engine limits •