Base | Representation |
---|---|
bin | 10000000011010000100… |
… | …001010001011110001101 |
3 | 10220110001122221011121102 |
4 | 100003100201101132031 |
5 | 121032431030323041 |
6 | 2202414340312445 |
7 | 142455421253612 |
oct | 20032041213615 |
9 | 3813048834542 |
10 | 1103010011021 |
11 | 395869439906 |
12 | 15992b9a2725 |
13 | 80023586399 |
14 | 3b559158509 |
15 | 1da59d7109b |
hex | 100d085178d |
1103010011021 has 2 divisors, whose sum is σ = 1103010011022. Its totient is φ = 1103010011020.
The previous prime is 1103010011011. The next prime is 1103010011039. The reversal of 1103010011021 is 1201100103011.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1049088062500 + 53921948521 = 1024250^2 + 232211^2 .
It is a cyclic number.
It is not a de Polignac number, because 1103010011021 - 218 = 1103009748877 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 = 1103010010993 and 1103010011011.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1103010011011) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 551505005510 + 551505005511.
It is an arithmetic number, because the mean of its divisors is an integer number (551505005511).
Almost surely, 21103010011021 is an apocalyptic number.
It is an amenable number.
1103010011021 is a deficient number, since it is larger than the sum of its proper divisors (1).
1103010011021 is an equidigital number, since it uses as much as digits as its factorization.
1103010011021 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6, while the sum is 11.
Adding to 1103010011021 its reverse (1201100103011), we get a palindrome (2304110114032).
The spelling of 1103010011021 in words is "one trillion, one hundred three billion, ten million, eleven thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •