Base | Representation |
---|---|
bin | 10000110011101101001… |
… | …101100001111110100001 |
3 | 11002102100002120100000001 |
4 | 100303231031201332201 |
5 | 122411000412420221 |
6 | 2242340334300001 |
7 | 146306513234641 |
oct | 20635515417641 |
9 | 4072302510001 |
10 | 1155030982561 |
11 | 405933972775 |
12 | 167a29657601 |
13 | 84bc3c33b51 |
14 | 3dc92042521 |
15 | 200a1d6c391 |
hex | 10ced361fa1 |
1155030982561 has 4 divisors (see below), whose sum is σ = 1162782868500. Its totient is φ = 1147279096624.
The previous prime is 1155030982537. The next prime is 1155030982597. The reversal of 1155030982561 is 1652890305511.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 257511591936 + 897519390625 = 507456^2 + 947375^2 .
It is a cyclic number.
It is not a de Polignac number, because 1155030982561 - 27 = 1155030982433 is a prime.
It is a super-2 number, since 2×11550309825612 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1155030985561) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3875942746 + ... + 3875943043.
It is an arithmetic number, because the mean of its divisors is an integer number (290695717125).
Almost surely, 21155030982561 is an apocalyptic number.
It is an amenable number.
1155030982561 is a deficient number, since it is larger than the sum of its proper divisors (7751885939).
1155030982561 is an equidigital number, since it uses as much as digits as its factorization.
1155030982561 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7751885938.
The product of its (nonzero) digits is 324000, while the sum is 46.
The spelling of 1155030982561 in words is "one trillion, one hundred fifty-five billion, thirty million, nine hundred eighty-two thousand, five hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •