Base | Representation |
---|---|
bin | 100000110110111… |
… | …0010011010000101 |
3 | 2211211120220211202 |
4 | 1001231302122011 |
5 | 4224221200424 |
6 | 301222512245 |
7 | 36215165552 |
oct | 10155623205 |
9 | 2754526752 |
10 | 1102521989 |
11 | 5163880a8 |
12 | 269295685 |
13 | 14755489a |
14 | a65d7a29 |
15 | 66bd32ae |
hex | 41b72685 |
1102521989 has 2 divisors, whose sum is σ = 1102521990. Its totient is φ = 1102521988.
The previous prime is 1102521947. The next prime is 1102522013. The reversal of 1102521989 is 9891252011.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 703840900 + 398681089 = 26530^2 + 19967^2 .
It is an emirp because it is prime and its reverse (9891252011) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1102521989 is a prime.
It is a super-2 number, since 2×11025219892 = 2431109472457032242, which contains 22 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1102521929) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 551260994 + 551260995.
It is an arithmetic number, because the mean of its divisors is an integer number (551260995).
Almost surely, 21102521989 is an apocalyptic number.
It is an amenable number.
1102521989 is a deficient number, since it is larger than the sum of its proper divisors (1).
1102521989 is an equidigital number, since it uses as much as digits as its factorization.
1102521989 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 12960, while the sum is 38.
The square root of 1102521989 is about 33204.2465507049. The cubic root of 1102521989 is about 1033.0684221252.
The spelling of 1102521989 in words is "one billion, one hundred two million, five hundred twenty-one thousand, nine hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •