Base | Representation |
---|---|
bin | 1010010001110000100110… |
… | …0111100110101111010101 |
3 | 1111000021211210011210010111 |
4 | 2210130021213212233111 |
5 | 2440120322401124023 |
6 | 40011125523123021 |
7 | 2244261665000203 |
oct | 244341147465725 |
9 | 44007753153114 |
10 | 11300220333013 |
11 | 366743a866707 |
12 | 1326084b13471 |
13 | 63c7b5aa8b11 |
14 | 2b0d0da70073 |
15 | 148e2838c00d |
hex | a47099e6bd5 |
11300220333013 has 2 divisors, whose sum is σ = 11300220333014. Its totient is φ = 11300220333012.
The previous prime is 11300220332959. The next prime is 11300220333037. The reversal of 11300220333013 is 31033302200311.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 9551208793009 + 1749011540004 = 3090503^2 + 1322502^2 .
It is a cyclic number.
It is not a de Polignac number, because 11300220333013 - 213 = 11300220324821 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11300220333113) 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, 5650110166506 + 5650110166507.
It is an arithmetic number, because the mean of its divisors is an integer number (5650110166507).
Almost surely, 211300220333013 is an apocalyptic number.
It is an amenable number.
11300220333013 is a deficient number, since it is larger than the sum of its proper divisors (1).
11300220333013 is an equidigital number, since it uses as much as digits as its factorization.
11300220333013 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 972, while the sum is 22.
Adding to 11300220333013 its reverse (31033302200311), we get a palindrome (42333522533324).
The spelling of 11300220333013 in words is "eleven trillion, three hundred billion, two hundred twenty million, three hundred thirty-three thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •