Base | Representation |
---|---|
bin | 10100111000101100… |
… | …10001111101011101 |
3 | 1001221110021111010212 |
4 | 22130112101331131 |
5 | 140431013133041 |
6 | 5052353542205 |
7 | 544604051246 |
oct | 123426217535 |
9 | 31843244125 |
10 | 11213021021 |
11 | 4834504724 |
12 | 220b274965 |
13 | 10990c05a7 |
14 | 7852c1ccd |
15 | 45961b8eb |
hex | 29c591f5d |
11213021021 has 2 divisors, whose sum is σ = 11213021022. Its totient is φ = 11213021020.
The previous prime is 11213020993. The next prime is 11213021047. The reversal of 11213021021 is 12012031211.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10678948921 + 534072100 = 103339^2 + 23110^2 .
It is a cyclic number.
It is not a de Polignac number, because 11213021021 - 226 = 11145912157 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 11213020987 and 11213021005.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11213021081) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5606510510 + 5606510511.
It is an arithmetic number, because the mean of its divisors is an integer number (5606510511).
Almost surely, 211213021021 is an apocalyptic number.
It is an amenable number.
11213021021 is a deficient number, since it is larger than the sum of its proper divisors (1).
11213021021 is an equidigital number, since it uses as much as digits as its factorization.
11213021021 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 24, while the sum is 14.
Adding to 11213021021 its reverse (12012031211), we get a palindrome (23225052232).
The spelling of 11213021021 in words is "eleven billion, two hundred thirteen million, twenty-one thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •