Base | Representation |
---|---|
bin | 10011101011001101… |
… | …11010110010011100 |
3 | 1000021011021121111202 |
4 | 21311212322302130 |
5 | 133113121234012 |
6 | 4504055135032 |
7 | 522522423515 |
oct | 116546726234 |
9 | 30234247452 |
10 | 10563071132 |
11 | 453063a759 |
12 | 2069674478 |
13 | cc4556363 |
14 | 722c55a0c |
15 | 41c533cc2 |
hex | 2759bac9c |
10563071132 has 12 divisors (see below), whose sum is σ = 18524961000. Its totient is φ = 5270225136.
The previous prime is 10563071117. The next prime is 10563071143. The reversal of 10563071132 is 23117036501.
It is a super-2 number, since 2×105630711322 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 10563071095 and 10563071104.
It is a congruent number.
It is an unprimeable number.
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 3 ways as a sum of consecutive naturals, for example, 2825507 + ... + 2829242.
It is an arithmetic number, because the mean of its divisors is an integer number (1543746750).
Almost surely, 210563071132 is an apocalyptic number.
It is an amenable number.
10563071132 is a deficient number, since it is larger than the sum of its proper divisors (7961889868).
10563071132 is a wasteful number, since it uses less digits than its factorization.
10563071132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5655220 (or 5655218 counting only the distinct ones).
The product of its (nonzero) digits is 3780, while the sum is 29.
The spelling of 10563071132 in words is "ten billion, five hundred sixty-three million, seventy-one thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •