Base | Representation |
---|---|
bin | 1010010010011000110010… |
… | …1111110001000100101111 |
3 | 1111001022200202020221202201 |
4 | 2210212030233301010233 |
5 | 2440304422104104013 |
6 | 40020112324002331 |
7 | 2245123243355464 |
oct | 244461457610457 |
9 | 44038622227681 |
10 | 11311010222383 |
11 | 3670a77436253 |
12 | 13281965303a7 |
13 | 640815319141 |
14 | 2b1654a8966b |
15 | 14935a7763dd |
hex | a498cbf112f |
11311010222383 has 2 divisors, whose sum is σ = 11311010222384. Its totient is φ = 11311010222382.
The previous prime is 11311010222299. The next prime is 11311010222419. The reversal of 11311010222383 is 38322201011311.
11311010222383 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 a de Polignac number, because none of the positive numbers 2k-11311010222383 is a prime.
It is a super-2 number, since 2×113110102223832 (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 (11311010222783) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5655505111191 + 5655505111192.
It is an arithmetic number, because the mean of its divisors is an integer number (5655505111192).
Almost surely, 211311010222383 is an apocalyptic number.
11311010222383 is a deficient number, since it is larger than the sum of its proper divisors (1).
11311010222383 is an equidigital number, since it uses as much as digits as its factorization.
11311010222383 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1728, while the sum is 28.
Adding to 11311010222383 its reverse (38322201011311), we get a palindrome (49633211233694).
The spelling of 11311010222383 in words is "eleven trillion, three hundred eleven billion, ten million, two hundred twenty-two thousand, three hundred eighty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •