Base | Representation |
---|---|
bin | 10011000000000100… |
… | …11011111101010100 |
3 | 222022221022221121121 |
4 | 21200002123331110 |
5 | 131343000424012 |
6 | 4404130453324 |
7 | 510536436304 |
oct | 114002337524 |
9 | 28287287547 |
10 | 10201186132 |
11 | 4365338145 |
12 | 1b88434244 |
13 | c6759b617 |
14 | 6cab73604 |
15 | 3ea89da07 |
hex | 26009bf54 |
10201186132 has 12 divisors (see below), whose sum is σ = 17961598816. Its totient is φ = 5069300760.
The previous prime is 10201186129. The next prime is 10201186133. The reversal of 10201186132 is 23168110201.
It is a junction number, because it is equal to n+sod(n) for n = 10201186097 and 10201186106.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10201186133) 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, 7822344 + ... + 7823647.
Almost surely, 210201186132 is an apocalyptic number.
It is an amenable number.
10201186132 is a deficient number, since it is larger than the sum of its proper divisors (7760412684).
10201186132 is a wasteful number, since it uses less digits than its factorization.
10201186132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15646158 (or 15646156 counting only the distinct ones).
The product of its (nonzero) digits is 576, while the sum is 25.
Adding to 10201186132 its reverse (23168110201), we get a palindrome (33369296333).
The spelling of 10201186132 in words is "ten billion, two hundred one million, one hundred eighty-six thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •