Base | Representation |
---|---|
bin | 10101000100010000… |
… | …01110100010011001 |
3 | 1002012012202112200022 |
4 | 22202020032202121 |
5 | 141130330002111 |
6 | 5110140320225 |
7 | 550162262516 |
oct | 124210164231 |
9 | 32165675608 |
10 | 11310000281 |
11 | 4884222678 |
12 | 2237843075 |
13 | 10b3217178 |
14 | 79412830d |
15 | 462dc62db |
hex | 2a220e899 |
11310000281 has 2 divisors, whose sum is σ = 11310000282. Its totient is φ = 11310000280.
The previous prime is 11310000263. The next prime is 11310000283. The reversal of 11310000281 is 18200001311.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 7892545600 + 3417454681 = 88840^2 + 58459^2 .
It is a cyclic number.
It is not a de Polignac number, because 11310000281 - 226 = 11242891417 is a prime.
It is a super-2 number, since 2×113100002812 (a number of 21 digits) contains 22 as substring.
Together with 11310000283, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (11310000283) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5655000140 + 5655000141.
It is an arithmetic number, because the mean of its divisors is an integer number (5655000141).
Almost surely, 211310000281 is an apocalyptic number.
It is an amenable number.
11310000281 is a deficient number, since it is larger than the sum of its proper divisors (1).
11310000281 is an equidigital number, since it uses as much as digits as its factorization.
11310000281 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 48, while the sum is 17.
Adding to 11310000281 its reverse (18200001311), we get a palindrome (29510001592).
The spelling of 11310000281 in words is "eleven billion, three hundred ten million, two hundred eighty-one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •