Base | Representation |
---|---|
bin | 1010010010011001111000… |
… | …0000001110010000110001 |
3 | 1111001100102221001102111112 |
4 | 2210212132000032100301 |
5 | 2440311020213431123 |
6 | 40020201145323105 |
7 | 2245133360324243 |
oct | 244463600162061 |
9 | 44040387042445 |
10 | 11311299748913 |
11 | 367110590687a |
12 | 1328257496495 |
13 | 6408602baa08 |
14 | 2b16812d4093 |
15 | 149375db6d78 |
hex | a499e00e431 |
11311299748913 has 2 divisors, whose sum is σ = 11311299748914. Its totient is φ = 11311299748912.
The previous prime is 11311299748877. The next prime is 11311299748933. The reversal of 11311299748913 is 31984799211311.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 7739679792784 + 3571619956129 = 2782028^2 + 1889873^2 .
It is a cyclic number.
It is not a de Polignac number, because 11311299748913 - 220 = 11311298700337 is a prime.
It is not a weakly prime, because it can be changed into another prime (11311299748933) 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, 5655649874456 + 5655649874457.
It is an arithmetic number, because the mean of its divisors is an integer number (5655649874457).
Almost surely, 211311299748913 is an apocalyptic number.
It is an amenable number.
11311299748913 is a deficient number, since it is larger than the sum of its proper divisors (1).
11311299748913 is an equidigital number, since it uses as much as digits as its factorization.
11311299748913 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 2939328, while the sum is 59.
The spelling of 11311299748913 in words is "eleven trillion, three hundred eleven billion, two hundred ninety-nine million, seven hundred forty-eight thousand, nine hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •