Base | Representation |
---|---|
bin | 10010110111110110… |
… | …00000100101010011 |
3 | 222011010101112120221 |
4 | 21123323000211103 |
5 | 131222311131011 |
6 | 4353222413511 |
7 | 506040453664 |
oct | 113373004523 |
9 | 28133345527 |
10 | 10132130131 |
11 | 432a361372 |
12 | 1b69291297 |
13 | c561a0696 |
14 | 6c191936b |
15 | 3e47ac971 |
hex | 25bec0953 |
10132130131 has 16 divisors (see below), whose sum is σ = 10712249856. Its totient is φ = 9563913216.
The previous prime is 10132130111. The next prime is 10132130137. The reversal of 10132130131 is 13103123101.
10132130131 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10132130131 is a prime.
It is a super-2 number, since 2×101321301312 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10132130137) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2026771 + ... + 2031763.
It is an arithmetic number, because the mean of its divisors is an integer number (669515616).
Almost surely, 210132130131 is an apocalyptic number.
10132130131 is a deficient number, since it is larger than the sum of its proper divisors (580119725).
10132130131 is a wasteful number, since it uses less digits than its factorization.
10132130131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6162.
The product of its (nonzero) digits is 54, while the sum is 16.
Adding to 10132130131 its reverse (13103123101), we get a palindrome (23235253232).
The spelling of 10132130131 in words is "ten billion, one hundred thirty-two million, one hundred thirty thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.294 sec. • engine limits •