Base | Representation |
---|---|
bin | 1010000011100100000000… |
… | …1101111110011011100001 |
3 | 1110010222022011201222101101 |
4 | 2200321000031332123201 |
5 | 2422121322221202223 |
6 | 35303112121434401 |
7 | 2220535665535312 |
oct | 240710015763341 |
9 | 43128264658341 |
10 | 11056323225313 |
11 | 3582a6224a803 |
12 | 12a695833ba01 |
13 | 6227b71ccb02 |
14 | 2a31b39b2609 |
15 | 1429012324ad |
hex | a0e4037e6e1 |
11056323225313 has 2 divisors, whose sum is σ = 11056323225314. Its totient is φ = 11056323225312.
The previous prime is 11056323225253. The next prime is 11056323225331. The reversal of 11056323225313 is 31352232365011.
Together with next prime (11056323225331) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10689708718144 + 366614507169 = 3269512^2 + 605487^2 .
It is an emirp because it is prime and its reverse (31352232365011) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 11056323225313 - 29 = 11056323224801 is a prime.
It is not a weakly prime, because it can be changed into another prime (11056323225113) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5528161612656 + 5528161612657.
It is an arithmetic number, because the mean of its divisors is an integer number (5528161612657).
Almost surely, 211056323225313 is an apocalyptic number.
It is an amenable number.
11056323225313 is a deficient number, since it is larger than the sum of its proper divisors (1).
11056323225313 is an equidigital number, since it uses as much as digits as its factorization.
11056323225313 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 97200, while the sum is 37.
The spelling of 11056323225313 in words is "eleven trillion, fifty-six billion, three hundred twenty-three million, two hundred twenty-five thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •