Base | Representation |
---|---|
bin | 1010001101101111100011… |
… | …1100000111011010110001 |
3 | 1110202200202002210112012101 |
4 | 2203123320330013122301 |
5 | 2433003020040122322 |
6 | 35515315100300401 |
7 | 2236300061343253 |
oct | 243337074073261 |
9 | 43680662715171 |
10 | 11231221020337 |
11 | 364015251785a |
12 | 1314829241701 |
13 | 63613aa7c456 |
14 | 2ab845d03cd3 |
15 | 14723aa46327 |
hex | a36f8f076b1 |
11231221020337 has 2 divisors, whose sum is σ = 11231221020338. Its totient is φ = 11231221020336.
The previous prime is 11231221020301. The next prime is 11231221020347. The reversal of 11231221020337 is 73302012213211.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 11099851742736 + 131369277601 = 3331644^2 + 362449^2 .
It is a cyclic number.
It is not a de Polignac number, because 11231221020337 - 239 = 10681465206449 is a prime.
It is a super-2 number, since 2×112312210203372 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (11231221020347) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5615610510168 + 5615610510169.
It is an arithmetic number, because the mean of its divisors is an integer number (5615610510169).
Almost surely, 211231221020337 is an apocalyptic number.
It is an amenable number.
11231221020337 is a deficient number, since it is larger than the sum of its proper divisors (1).
11231221020337 is an equidigital number, since it uses as much as digits as its factorization.
11231221020337 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 3024, while the sum is 28.
Adding to 11231221020337 its reverse (73302012213211), we get a palindrome (84533233233548).
The spelling of 11231221020337 in words is "eleven trillion, two hundred thirty-one billion, two hundred twenty-one million, twenty thousand, three hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •