Base | Representation |
---|---|
bin | 1010010010111010101100… |
… | …1101101000001010001111 |
3 | 1111002012012000112122221021 |
4 | 2210232223031220022033 |
5 | 2440432041443120023 |
6 | 40024215355415011 |
7 | 2245564624304242 |
oct | 244565315501217 |
9 | 44065160478837 |
10 | 11320111301263 |
11 | 3674917795546 |
12 | 1329ab6454467 |
13 | 6416359ca00b |
14 | 2b1c79693259 |
15 | 1496de76c35d |
hex | a4bab36828f |
11320111301263 has 2 divisors, whose sum is σ = 11320111301264. Its totient is φ = 11320111301262.
The previous prime is 11320111301251. The next prime is 11320111301311. The reversal of 11320111301263 is 36210311102311.
11320111301263 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11320111301263 is a prime.
It is a super-2 number, since 2×113201113012632 (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 (11320111302263) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5660055650631 + 5660055650632.
It is an arithmetic number, because the mean of its divisors is an integer number (5660055650632).
Almost surely, 211320111301263 is an apocalyptic number.
11320111301263 is a deficient number, since it is larger than the sum of its proper divisors (1).
11320111301263 is an equidigital number, since it uses as much as digits as its factorization.
11320111301263 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 648, while the sum is 25.
Adding to 11320111301263 its reverse (36210311102311), we get a palindrome (47530422403574).
The spelling of 11320111301263 in words is "eleven trillion, three hundred twenty billion, one hundred eleven million, three hundred one thousand, two hundred sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.023 sec. • engine limits •