Base | Representation |
---|---|
bin | 10010110111110111… |
… | …01111011101010011 |
3 | 222011010202021222001 |
4 | 21123323233131103 |
5 | 131222333302011 |
6 | 4353230454431 |
7 | 506042213521 |
oct | 113373573523 |
9 | 28133667861 |
10 | 10132322131 |
11 | 432a482648 |
12 | 1b69364417 |
13 | c56239ba9 |
14 | 6c1969311 |
15 | 3e47e97c1 |
hex | 25beef753 |
10132322131 has 8 divisors (see below), whose sum is σ = 10482480000. Its totient is φ = 9783621120.
The previous prime is 10132322129. The next prime is 10132322143. The reversal of 10132322131 is 13122323101.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 10132322131 - 21 = 10132322129 is a prime.
It is a super-2 number, since 2×101323221312 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10132322099 and 10132322108.
It is not an unprimeable number, because it can be changed into a prime (10132322111) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 350056 + ... + 377893.
It is an arithmetic number, because the mean of its divisors is an integer number (1310310000).
Almost surely, 210132322131 is an apocalyptic number.
10132322131 is a deficient number, since it is larger than the sum of its proper divisors (350157869).
10132322131 is an equidigital number, since it uses as much as digits as its factorization.
10132322131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 728429.
The product of its (nonzero) digits is 216, while the sum is 19.
Adding to 10132322131 its reverse (13122323101), we get a palindrome (23254645232).
The spelling of 10132322131 in words is "ten billion, one hundred thirty-two million, three hundred twenty-two thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •