Base | Representation |
---|---|
bin | 1001001101110001011011… |
… | …0010001101101011001111 |
3 | 1022212122000010212212211210 |
4 | 2103130112302031223033 |
5 | 2312001231242110411 |
6 | 33314401214345503 |
7 | 2064012416641413 |
oct | 223342662155317 |
9 | 38778003785753 |
10 | 10132210113231 |
11 | 325705650aa08 |
12 | 11778347bb293 |
13 | 586603b9295b |
14 | 270589d48d43 |
15 | 128866d1eca6 |
hex | 93716c8dacf |
10132210113231 has 16 divisors (see below), whose sum is σ = 13517886790656. Its totient is φ = 6750670569216.
The previous prime is 10132210113229. The next prime is 10132210113269. The reversal of 10132210113231 is 13231101223101.
It is not a de Polignac number, because 10132210113231 - 21 = 10132210113229 is a prime.
It is a super-2 number, since 2×101322101132312 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 10132210113198 and 10132210113207.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10132210113281) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 101635296 + ... + 101734938.
It is an arithmetic number, because the mean of its divisors is an integer number (844867924416).
Almost surely, 210132210113231 is an apocalyptic number.
10132210113231 is a deficient number, since it is larger than the sum of its proper divisors (3385676677425).
10132210113231 is a wasteful number, since it uses less digits than its factorization.
10132210113231 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 120062.
The product of its (nonzero) digits is 216, while the sum is 21.
Adding to 10132210113231 its reverse (13231101223101), we get a palindrome (23363311336332).
The spelling of 10132210113231 in words is "ten trillion, one hundred thirty-two billion, two hundred ten million, one hundred thirteen thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •