Base | Representation |
---|---|
bin | 10011101010111111… |
… | …00111010000100011 |
3 | 1000021000200022121210 |
4 | 21311133213100203 |
5 | 133112123444011 |
6 | 4503550121203 |
7 | 522500226441 |
oct | 116537472043 |
9 | 30230608553 |
10 | 10561156131 |
11 | 452a551a09 |
12 | 2068ab0203 |
13 | cc4035816 |
14 | 7228b7b91 |
15 | 41c2a66a6 |
hex | 2757e7423 |
10561156131 has 8 divisors (see below), whose sum is σ = 14106824784. Its totient is φ = 7028129120.
The previous prime is 10561156129. The next prime is 10561156217. The reversal of 10561156131 is 13165116501.
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 10561156131 - 21 = 10561156129 is a prime.
It is a super-2 number, since 2×105611561312 (a number of 21 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (10561106131) 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, 3158460 + ... + 3161801.
It is an arithmetic number, because the mean of its divisors is an integer number (1763353098).
Almost surely, 210561156131 is an apocalyptic number.
10561156131 is a deficient number, since it is larger than the sum of its proper divisors (3545668653).
10561156131 is an equidigital number, since it uses as much as digits as its factorization.
10561156131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6320821.
The product of its (nonzero) digits is 2700, while the sum is 30.
The spelling of 10561156131 in words is "ten billion, five hundred sixty-one million, one hundred fifty-six thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •