Base | Representation |
---|---|
bin | 100000111000000… |
… | …0100110000001101 |
3 | 2211212201101002221 |
4 | 1001300010300031 |
5 | 4224344341141 |
6 | 301243415341 |
7 | 36223243303 |
oct | 10160046015 |
9 | 2755641087 |
10 | 1103121421 |
11 | 5167574a6 |
12 | 269524551 |
13 | 14770468c |
14 | a6712273 |
15 | 66ca0bd1 |
hex | 41c04c0d |
1103121421 has 2 divisors, whose sum is σ = 1103121422. Its totient is φ = 1103121420.
The previous prime is 1103121403. The next prime is 1103121427. The reversal of 1103121421 is 1241213011.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 961868196 + 141253225 = 31014^2 + 11885^2 .
It is an emirp because it is prime and its reverse (1241213011) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1103121421 - 211 = 1103119373 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1103121395 and 1103121404.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1103121427) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 551560710 + 551560711.
It is an arithmetic number, because the mean of its divisors is an integer number (551560711).
Almost surely, 21103121421 is an apocalyptic number.
It is an amenable number.
1103121421 is a deficient number, since it is larger than the sum of its proper divisors (1).
1103121421 is an equidigital number, since it uses as much as digits as its factorization.
1103121421 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 48, while the sum is 16.
The square root of 1103121421 is about 33213.2717599456. The cubic root of 1103121421 is about 1033.2556117633.
Adding to 1103121421 its reverse (1241213011), we get a palindrome (2344334432).
The spelling of 1103121421 in words is "one billion, one hundred three million, one hundred twenty-one thousand, four hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •