Base | Representation |
---|---|
bin | 10011101001110011… |
… | …01100101111101011 |
3 | 1000020022222100212200 |
4 | 21310321230233223 |
5 | 133102102422011 |
6 | 4502553111243 |
7 | 522316602660 |
oct | 116471545753 |
9 | 30208870780 |
10 | 10551217131 |
11 | 4524983664 |
12 | 20656b8523 |
13 | cc1c65960 |
14 | 72144ba67 |
15 | 41b491856 |
hex | 274e6cbeb |
10551217131 has 48 divisors (see below), whose sum is σ = 18801671616. Its totient is φ = 5552437248.
The previous prime is 10551217129. The next prime is 10551217141. The reversal of 10551217131 is 13171215501.
10551217131 is a `hidden beast` number, since 1 + 0 + 5 + 512 + 17 + 131 = 666.
It is not a de Polignac number, because 10551217131 - 21 = 10551217129 is a prime.
It is a super-2 number, since 2×105512171312 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 10551217095 and 10551217104.
It is not an unprimeable number, because it can be changed into a prime (10551217141) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 339751 + ... + 369503.
It is an arithmetic number, because the mean of its divisors is an integer number (391701492).
Almost surely, 210551217131 is an apocalyptic number.
10551217131 is a deficient number, since it is larger than the sum of its proper divisors (8250454485).
10551217131 is a wasteful number, since it uses less digits than its factorization.
10551217131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 30212 (or 30209 counting only the distinct ones).
The product of its (nonzero) digits is 1050, while the sum is 27.
The spelling of 10551217131 in words is "ten billion, five hundred fifty-one million, two hundred seventeen thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •