Base | Representation |
---|---|
bin | 10101010001101000… |
… | …11110011011000101 |
3 | 1002111001000002011002 |
4 | 22220310132123011 |
5 | 141343044403411 |
6 | 5125230423045 |
7 | 553024430153 |
oct | 125064363305 |
9 | 32431002132 |
10 | 11422262981 |
11 | 493162a268 |
12 | 2269361a85 |
13 | 11005623bc |
14 | 7a4dcc3d3 |
15 | 46cb9e33b |
hex | 2a8d1e6c5 |
11422262981 has 2 divisors, whose sum is σ = 11422262982. Its totient is φ = 11422262980.
The previous prime is 11422262897. The next prime is 11422263001. The reversal of 11422262981 is 18926222411.
11422262981 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., 9711117025 + 1711145956 = 98545^2 + 41366^2 .
It is a cyclic number.
It is not a de Polignac number, because 11422262981 - 214 = 11422246597 is a prime.
It is a super-2 number, since 2×114222629812 (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 (11422262081) 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, 5711131490 + 5711131491.
It is an arithmetic number, because the mean of its divisors is an integer number (5711131491).
Almost surely, 211422262981 is an apocalyptic number.
It is an amenable number.
11422262981 is a deficient number, since it is larger than the sum of its proper divisors (1).
11422262981 is an equidigital number, since it uses as much as digits as its factorization.
11422262981 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 27648, while the sum is 38.
The spelling of 11422262981 in words is "eleven billion, four hundred twenty-two million, two hundred sixty-two thousand, nine hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.204 sec. • engine limits •