Base | Representation |
---|---|
bin | 10000000011010001001… |
… | …011100111101111000001 |
3 | 10220110002102211011122022 |
4 | 100003101023213233001 |
5 | 121032441401043012 |
6 | 2202415414251225 |
7 | 142455614521001 |
oct | 20032113475701 |
9 | 3813072734568 |
10 | 1103021112257 |
11 | 395874731389 |
12 | 159933656b15 |
13 | 8002597226c |
14 | 3b55a808001 |
15 | 1da5ad15472 |
hex | 100d12e7bc1 |
1103021112257 has 2 divisors, whose sum is σ = 1103021112258. Its totient is φ = 1103021112256.
The previous prime is 1103021112223. The next prime is 1103021112283. The reversal of 1103021112257 is 7522111203011.
It is a happy number.
It is an a-pointer prime, because the next prime (1103021112283) can be obtained adding 1103021112257 to its sum of digits (26).
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1007937689521 + 95083422736 = 1003961^2 + 308356^2 .
It is a cyclic number.
It is not a de Polignac number, because 1103021112257 - 28 = 1103021112001 is a prime.
It is not a weakly prime, because it can be changed into another prime (1103021112287) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 551510556128 + 551510556129.
It is an arithmetic number, because the mean of its divisors is an integer number (551510556129).
Almost surely, 21103021112257 is an apocalyptic number.
It is an amenable number.
1103021112257 is a deficient number, since it is larger than the sum of its proper divisors (1).
1103021112257 is an equidigital number, since it uses as much as digits as its factorization.
1103021112257 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 840, while the sum is 26.
Adding to 1103021112257 its reverse (7522111203011), we get a palindrome (8625132315268).
The spelling of 1103021112257 in words is "one trillion, one hundred three billion, twenty-one million, one hundred twelve thousand, two hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •