Base | Representation |
---|---|
bin | 10000011000000001011… |
… | …011110101011011110001 |
3 | 10222120121110211122022222 |
4 | 100120001123311123301 |
5 | 121414111202134041 |
6 | 2220542550210425 |
7 | 144205055655401 |
oct | 20300133653361 |
9 | 3876543748288 |
10 | 1125305505521 |
11 | 3a426a69191a |
12 | 162112653a15 |
13 | 821676b9492 |
14 | 3c672258801 |
15 | 1e4123bd74b |
hex | 106016f56f1 |
1125305505521 has 8 divisors (see below), whose sum is σ = 1175094635904. Its totient is φ = 1075588275520.
The previous prime is 1125305505439. The next prime is 1125305505523. The reversal of 1125305505521 is 1255055035211.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1125305505521 is a prime.
It is a super-2 number, since 2×11253055055212 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (1125305505523) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 17943101 + ... + 18005706.
It is an arithmetic number, because the mean of its divisors is an integer number (146886829488).
Almost surely, 21125305505521 is an apocalyptic number.
It is an amenable number.
1125305505521 is a deficient number, since it is larger than the sum of its proper divisors (49789130383).
1125305505521 is a wasteful number, since it uses less digits than its factorization.
1125305505521 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 35950191.
The product of its (nonzero) digits is 37500, while the sum is 35.
The spelling of 1125305505521 in words is "one trillion, one hundred twenty-five billion, three hundred five million, five hundred five thousand, five hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •