Base | Representation |
---|---|
bin | 10010110111101111… |
… | …11000011011111101 |
3 | 222011001211220001001 |
4 | 21123313320123331 |
5 | 131222103412313 |
6 | 4353153050301 |
7 | 506030500624 |
oct | 113367703375 |
9 | 28131756031 |
10 | 10131310333 |
11 | 4329951451 |
12 | 1b68b56991 |
13 | c55c744b1 |
14 | 6c17846bb |
15 | 3e4699add |
hex | 25bdf86fd |
10131310333 has 2 divisors, whose sum is σ = 10131310334. Its totient is φ = 10131310332.
The previous prime is 10131310223. The next prime is 10131310351. The reversal of 10131310333 is 33301313101.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10058685849 + 72624484 = 100293^2 + 8522^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10131310333 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 10131310333.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10131310373) 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 as a sum of consecutive naturals, namely, 5065655166 + 5065655167.
It is an arithmetic number, because the mean of its divisors is an integer number (5065655167).
Almost surely, 210131310333 is an apocalyptic number.
It is an amenable number.
10131310333 is a deficient number, since it is larger than the sum of its proper divisors (1).
10131310333 is an equidigital number, since it uses as much as digits as its factorization.
10131310333 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 243, while the sum is 19.
Adding to 10131310333 its reverse (33301313101), we get a palindrome (43432623434).
The spelling of 10131310333 in words is "ten billion, one hundred thirty-one million, three hundred ten thousand, three hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.890 sec. • engine limits •