Base | Representation |
---|---|
bin | 1010001101101111100011… |
… | …1100000111011111101101 |
3 | 1110202200202002210112122002 |
4 | 2203123320330013133231 |
5 | 2433003020040130103 |
6 | 35515315100302045 |
7 | 2236300061344214 |
oct | 243337074073755 |
9 | 43680662715562 |
10 | 11231221020653 |
11 | 3640152518017 |
12 | 1314829241925 |
13 | 63613aa7c63a |
14 | 2ab845d0407b |
15 | 14723aa46488 |
hex | a36f8f077ed |
11231221020653 has 2 divisors, whose sum is σ = 11231221020654. Its totient is φ = 11231221020652.
The previous prime is 11231221020647. The next prime is 11231221020709. The reversal of 11231221020653 is 35602012213211.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 9817362093289 + 1413858927364 = 3133267^2 + 1189058^2 .
It is a cyclic number.
It is not a de Polignac number, because 11231221020653 - 216 = 11231220955117 is a prime.
It is a super-2 number, since 2×112312210206532 (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 (11231221020353) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5615610510326 + 5615610510327.
It is an arithmetic number, because the mean of its divisors is an integer number (5615610510327).
Almost surely, 211231221020653 is an apocalyptic number.
It is an amenable number.
11231221020653 is a deficient number, since it is larger than the sum of its proper divisors (1).
11231221020653 is an equidigital number, since it uses as much as digits as its factorization.
11231221020653 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4320, while the sum is 29.
Adding to 11231221020653 its reverse (35602012213211), we get a palindrome (46833233233864).
The spelling of 11231221020653 in words is "eleven trillion, two hundred thirty-one billion, two hundred twenty-one million, twenty thousand, six hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •