Base | Representation |
---|---|
bin | 10111001110000100011110… |
… | …001000101100100101010101 |
3 | 111101120202120210102021101201 |
4 | 113032010132020230211111 |
5 | 101341131214401240422 |
6 | 1001110101205152501 |
7 | 30340031643035116 |
oct | 2716043610544525 |
9 | 441522523367351 |
10 | 102121942993237 |
11 | 2a5a2744562712 |
12 | b553b000bb731 |
13 | 44ca09a29c2cb |
14 | 1b30a2aaa420d |
15 | bc165d104727 |
hex | 5ce11e22c955 |
102121942993237 has 2 divisors, whose sum is σ = 102121942993238. Its totient is φ = 102121942993236.
The previous prime is 102121942993207. The next prime is 102121942993243. The reversal of 102121942993237 is 732399249121201.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 90779906566801 + 11342036426436 = 9527849^2 + 3367794^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-102121942993237 is a prime.
It is a super-3 number, since 3×1021219429932373 (a number of 43 digits) contains 333 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (102121942993207) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51060971496618 + 51060971496619.
It is an arithmetic number, because the mean of its divisors is an integer number (51060971496619).
Almost surely, 2102121942993237 is an apocalyptic number.
It is an amenable number.
102121942993237 is a deficient number, since it is larger than the sum of its proper divisors (1).
102121942993237 is an equidigital number, since it uses as much as digits as its factorization.
102121942993237 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 2939328, while the sum is 55.
The spelling of 102121942993237 in words is "one hundred two trillion, one hundred twenty-one billion, nine hundred forty-two million, nine hundred ninety-three thousand, two hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •