Base | Representation |
---|---|
bin | 10001110000101101001… |
… | …011001101110101000001 |
3 | 11022200101201221102011022 |
4 | 101300231023031311001 |
5 | 124444120312031014 |
6 | 2332411512155225 |
7 | 154115560103366 |
oct | 21605513156501 |
9 | 4280351842138 |
10 | 1220528627009 |
11 | 43069465543a |
12 | 178668698b15 |
13 | 8b13165b793 |
14 | 43106ad846d |
15 | 21b37076a8e |
hex | 11c2d2cdd41 |
1220528627009 has 8 divisors (see below), whose sum is σ = 1237347969000. Its totient is φ = 1203711981696.
The previous prime is 1220528626997. The next prime is 1220528627027. The reversal of 1220528627009 is 9007268250221.
It can be written as a sum of positive squares in 4 ways, for example, as 745114240000 + 475414387009 = 863200^2 + 689503^2 .
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 1220528627009 - 212 = 1220528622913 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1220528627069) 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, 245867 + ... + 1581615.
It is an arithmetic number, because the mean of its divisors is an integer number (154668496125).
Almost surely, 21220528627009 is an apocalyptic number.
It is an amenable number.
1220528627009 is a deficient number, since it is larger than the sum of its proper divisors (16819341991).
1220528627009 is a wasteful number, since it uses less digits than its factorization.
1220528627009 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1348339.
The product of its (nonzero) digits is 241920, while the sum is 44.
The spelling of 1220528627009 in words is "one trillion, two hundred twenty billion, five hundred twenty-eight million, six hundred twenty-seven thousand, nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •