Base | Representation |
---|---|
bin | 1010010001110011111000… |
… | …1110110101001011000101 |
3 | 1111000101010022010111002211 |
4 | 2210130332032311023011 |
5 | 2440124124333442411 |
6 | 40011353254303421 |
7 | 2244322603544521 |
oct | 244347616651305 |
9 | 44011108114084 |
10 | 11301103030981 |
11 | 3667853050765 |
12 | 1326290657b71 |
13 | 63c8c69250ca |
14 | 2b0d94da4d81 |
15 | 148e7aaec221 |
hex | a473e3b52c5 |
11301103030981 has 2 divisors, whose sum is σ = 11301103030982. Its totient is φ = 11301103030980.
The previous prime is 11301103030963. The next prime is 11301103031033. The reversal of 11301103030981 is 18903030110311.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 11292893040100 + 8209990881 = 3360490^2 + 90609^2 .
It is a cyclic number.
It is not a de Polignac number, because 11301103030981 - 223 = 11301094642373 is a prime.
It is a super-2 number, since 2×113011030309812 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11301103030081) 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, 5650551515490 + 5650551515491.
It is an arithmetic number, because the mean of its divisors is an integer number (5650551515491).
Almost surely, 211301103030981 is an apocalyptic number.
It is an amenable number.
11301103030981 is a deficient number, since it is larger than the sum of its proper divisors (1).
11301103030981 is an equidigital number, since it uses as much as digits as its factorization.
11301103030981 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 31.
The spelling of 11301103030981 in words is "eleven trillion, three hundred one billion, one hundred three million, thirty thousand, nine hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •