Base | Representation |
---|---|
bin | 1010010010100000111101… |
… | …0101010100000111011111 |
3 | 1111001112100102210020102101 |
4 | 2210220033111110013133 |
5 | 2440323413440301302 |
6 | 40021113550105531 |
7 | 2245231445504464 |
oct | 244501725240737 |
9 | 44045312706371 |
10 | 11313201103327 |
11 | 36719a10a7562 |
12 | 13286a81ab2a7 |
13 | 640aa41a6bb6 |
14 | 2b17c1a3166b |
15 | 149437c91287 |
hex | a4a0f5541df |
11313201103327 has 2 divisors, whose sum is σ = 11313201103328. Its totient is φ = 11313201103326.
The previous prime is 11313201103313. The next prime is 11313201103339. The reversal of 11313201103327 is 72330110231311.
11313201103327 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 is a cyclic number.
It is not a de Polignac number, because 11313201103327 - 219 = 11313200579039 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 11313201103295 and 11313201103304.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11313201103427) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5656600551663 + 5656600551664.
It is an arithmetic number, because the mean of its divisors is an integer number (5656600551664).
Almost surely, 211313201103327 is an apocalyptic number.
11313201103327 is a deficient number, since it is larger than the sum of its proper divisors (1).
11313201103327 is an equidigital number, since it uses as much as digits as its factorization.
11313201103327 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 2268, while the sum is 28.
Adding to 11313201103327 its reverse (72330110231311), we get a palindrome (83643311334638).
The spelling of 11313201103327 in words is "eleven trillion, three hundred thirteen billion, two hundred one million, one hundred three thousand, three hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •