Base | Representation |
---|---|
bin | 101111000101000100… |
… | …1111100110011111001 |
3 | 100122221222110102200102 |
4 | 1132022021330303321 |
5 | 3124024120040433 |
6 | 114240133045145 |
7 | 10206255526001 |
oct | 1361211746371 |
9 | 318858412612 |
10 | 101102111993 |
11 | 39971563163 |
12 | 17716a867b5 |
13 | 96c2c4c80c |
14 | 4c7158d001 |
15 | 296ad8b4e8 |
hex | 178a27ccf9 |
101102111993 has 2 divisors, whose sum is σ = 101102111994. Its totient is φ = 101102111992.
The previous prime is 101102111989. The next prime is 101102112091. The reversal of 101102111993 is 399111201101.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 87475752169 + 13626359824 = 295763^2 + 116732^2 .
It is a cyclic number.
It is not a de Polignac number, because 101102111993 - 22 = 101102111989 is a prime.
It is a super-2 number, since 2×1011021119932 (a number of 23 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (101102111923) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50551055996 + 50551055997.
It is an arithmetic number, because the mean of its divisors is an integer number (50551055997).
Almost surely, 2101102111993 is an apocalyptic number.
It is an amenable number.
101102111993 is a deficient number, since it is larger than the sum of its proper divisors (1).
101102111993 is an equidigital number, since it uses as much as digits as its factorization.
101102111993 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 29.
The spelling of 101102111993 in words is "one hundred 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.070 sec. • engine limits •