Base | Representation |
---|---|
bin | 10100111010101110… |
… | …11110110111110101 |
3 | 1001222122102212022002 |
4 | 22131113132313311 |
5 | 140444402111034 |
6 | 5054204145045 |
7 | 545202250004 |
oct | 123527366765 |
9 | 31878385262 |
10 | 11230113269 |
11 | 4843119351 |
12 | 2214b38185 |
13 | 109c7c634b |
14 | 787690c3b |
15 | 45ad95e7e |
hex | 29d5dedf5 |
11230113269 has 2 divisors, whose sum is σ = 11230113270. Its totient is φ = 11230113268.
The previous prime is 11230113221. The next prime is 11230113281. The reversal of 11230113269 is 96231103211.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 9915180625 + 1314932644 = 99575^2 + 36262^2 .
It is an emirp because it is prime and its reverse (96231103211) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11230113269 is a prime.
It is a super-2 number, since 2×112301132692 (a number of 21 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11230113299) 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, 5615056634 + 5615056635.
It is an arithmetic number, because the mean of its divisors is an integer number (5615056635).
Almost surely, 211230113269 is an apocalyptic number.
It is an amenable number.
11230113269 is a deficient number, since it is larger than the sum of its proper divisors (1).
11230113269 is an equidigital number, since it uses as much as digits as its factorization.
11230113269 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1944, while the sum is 29.
The spelling of 11230113269 in words is "eleven billion, two hundred thirty million, one hundred thirteen thousand, two hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •