Base | Representation |
---|---|
bin | 10101000100110011… |
… | …01001111100010101 |
3 | 1002012112100122202102 |
4 | 22202121221330111 |
5 | 141133012201411 |
6 | 5110422251445 |
7 | 550246151402 |
oct | 124231517425 |
9 | 32175318672 |
10 | 11314568981 |
11 | 4886863161 |
12 | 2239286b85 |
13 | 10b4156841 |
14 | 7949972a9 |
15 | 4634c9d3b |
hex | 2a2669f15 |
11314568981 has 2 divisors, whose sum is σ = 11314568982. Its totient is φ = 11314568980.
The previous prime is 11314568939. The next prime is 11314568999. The reversal of 11314568981 is 18986541311.
11314568981 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 6306742225 + 5007826756 = 79415^2 + 70766^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11314568981 is a prime.
It is a super-2 number, since 2×113145689812 (a number of 21 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11314568911) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5657284490 + 5657284491.
It is an arithmetic number, because the mean of its divisors is an integer number (5657284491).
Almost surely, 211314568981 is an apocalyptic number.
It is an amenable number.
11314568981 is a deficient number, since it is larger than the sum of its proper divisors (1).
11314568981 is an equidigital number, since it uses as much as digits as its factorization.
11314568981 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 207360, while the sum is 47.
The spelling of 11314568981 in words is "eleven billion, three hundred fourteen million, five hundred sixty-eight thousand, nine hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •