Base | Representation |
---|---|
bin | 100000110110000… |
… | …1110010011111001 |
3 | 2211210211002102201 |
4 | 1001230032103321 |
5 | 4224120040433 |
6 | 301210030201 |
7 | 36211540333 |
oct | 10154162371 |
9 | 2753732381 |
10 | 1102111993 |
11 | 516128064 |
12 | 269118361 |
13 | 147440098 |
14 | a652c453 |
15 | 66b51a7d |
hex | 41b0e4f9 |
1102111993 has 2 divisors, whose sum is σ = 1102111994. Its totient is φ = 1102111992.
The previous prime is 1102111943. The next prime is 1102112017. The reversal of 1102111993 is 3991112011.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 765462889 + 336649104 = 27667^2 + 18348^2 .
It is an emirp because it is prime and its reverse (3991112011) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1102111993 - 229 = 565241081 is a prime.
It is a super-2 number, since 2×11021119932 = 2429301690228864098, which contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (1102111943) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 551055996 + 551055997.
It is an arithmetic number, because the mean of its divisors is an integer number (551055997).
Almost surely, 21102111993 is an apocalyptic number.
It is an amenable number.
1102111993 is a deficient number, since it is larger than the sum of its proper divisors (1).
1102111993 is an equidigital number, since it uses as much as digits as its factorization.
1102111993 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 486, while the sum is 28.
The square root of 1102111993 is about 33198.0721277607. The cubic root of 1102111993 is about 1032.9403501719.
The spelling of 1102111993 in words is "one billion, one hundred two million, one hundred eleven thousand, nine hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •