Base | Representation |
---|---|
bin | 10110111111001110101100… |
… | …000101000110100001110001 |
3 | 111020222021020201200011222002 |
4 | 112333032230011012201301 |
5 | 101222424121240333103 |
6 | 555005401310223345 |
7 | 30203246560232315 |
oct | 2677165405064161 |
9 | 436867221604862 |
10 | 101102122199153 |
11 | 2a23a195288869 |
12 | b40a3281b4b55 |
13 | 4454b737b245a |
14 | 1ad75240a3b45 |
15 | ba4d71720488 |
hex | 5bf3ac146871 |
101102122199153 has 2 divisors, whose sum is σ = 101102122199154. Its totient is φ = 101102122199152.
The previous prime is 101102122199083. The next prime is 101102122199159. The reversal of 101102122199153 is 351991221201101.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 92479630256689 + 8622491942464 = 9616633^2 + 2936408^2 .
It is a cyclic number.
It is not a de Polignac number, because 101102122199153 - 212 = 101102122195057 is a prime.
It is a super-2 number, since 2×1011021221991532 (a number of 29 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 (101102122199159) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50551061099576 + 50551061099577.
It is an arithmetic number, because the mean of its divisors is an integer number (50551061099577).
Almost surely, 2101102122199153 is an apocalyptic number.
It is an amenable number.
101102122199153 is a deficient number, since it is larger than the sum of its proper divisors (1).
101102122199153 is an equidigital number, since it uses as much as digits as its factorization.
101102122199153 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 9720, while the sum is 38.
The spelling of 101102122199153 in words is "one hundred one trillion, one hundred two billion, one hundred twenty-two million, one hundred ninety-nine thousand, one hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •