Base | Representation |
---|---|
bin | 10100100001000000… |
… | …10101101010001101 |
3 | 1001102121101222200222 |
4 | 22100200111222031 |
5 | 140024132043041 |
6 | 5020535201125 |
7 | 536642161151 |
oct | 122040255215 |
9 | 31377358628 |
10 | 11014331021 |
11 | 4742336a11 |
12 | 21748161a5 |
13 | 1066ba4645 |
14 | 766b61061 |
15 | 446e7074b |
hex | 290815a8d |
11014331021 has 2 divisors, whose sum is σ = 11014331022. Its totient is φ = 11014331020.
The previous prime is 11014330981. The next prime is 11014331023. The reversal of 11014331021 is 12013341011.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 6051128521 + 4963202500 = 77789^2 + 70450^2 .
It is a cyclic number.
It is not a de Polignac number, because 11014331021 - 226 = 10947222157 is a prime.
Together with 11014331023, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11014331023) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5507165510 + 5507165511.
It is an arithmetic number, because the mean of its divisors is an integer number (5507165511).
Almost surely, 211014331021 is an apocalyptic number.
It is an amenable number.
11014331021 is a deficient number, since it is larger than the sum of its proper divisors (1).
11014331021 is an equidigital number, since it uses as much as digits as its factorization.
11014331021 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 72, while the sum is 17.
Adding to 11014331021 its reverse (12013341011), we get a palindrome (23027672032).
The spelling of 11014331021 in words is "eleven billion, fourteen million, three hundred thirty-one thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •