Base | Representation |
---|---|
bin | 10010110111101110… |
… | …01100011110111111 |
3 | 222011001111202002021 |
4 | 21123313030132333 |
5 | 131222032132203 |
6 | 4353145141011 |
7 | 506026121020 |
oct | 113367143677 |
9 | 28131452067 |
10 | 10131130303 |
11 | 4329839168 |
12 | 1b68a8a767 |
13 | c55c10578 |
14 | 6c1738c47 |
15 | 3e46615bd |
hex | 25bdcc7bf |
10131130303 has 8 divisors (see below), whose sum is σ = 11580375200. Its totient is φ = 8682370560.
The previous prime is 10131130267. The next prime is 10131130337. The reversal of 10131130303 is 30303113101.
10131130303 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
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 10131130303 - 221 = 10129033151 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10131130103) 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, 75378 + ... + 161071.
It is an arithmetic number, because the mean of its divisors is an integer number (1447546900).
Almost surely, 210131130303 is an apocalyptic number.
10131130303 is a deficient number, since it is larger than the sum of its proper divisors (1449244897).
10131130303 is an equidigital number, since it uses as much as digits as its factorization.
10131130303 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 242577.
The product of its (nonzero) digits is 81, while the sum is 16.
Adding to 10131130303 its reverse (30303113101), we get a palindrome (40434243404).
The spelling of 10131130303 in words is "ten billion, one hundred thirty-one million, one hundred thirty thousand, three hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •