Base | Representation |
---|---|
bin | 10111001110000100100011… |
… | …100000000111110100100001 |
3 | 111101120202211001211010011102 |
4 | 113032010203200013310201 |
5 | 101341131410423121233 |
6 | 1001110114142524145 |
7 | 30340034115202304 |
oct | 2716044340076441 |
9 | 441522731733142 |
10 | 102122033020193 |
11 | 2a5a279036225a |
12 | b553b26296655 |
13 | 44ca0b2b305b4 |
14 | 1b30a38a1ab3b |
15 | bc1665e891e8 |
hex | 5ce123807d21 |
102122033020193 has 2 divisors, whose sum is σ = 102122033020194. Its totient is φ = 102122033020192.
The previous prime is 102122033020187. The next prime is 102122033020247. The reversal of 102122033020193 is 391020330221201.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 97921078578064 + 4200954442129 = 9895508^2 + 2049623^2 .
It is an emirp because it is prime and its reverse (391020330221201) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 102122033020193 - 224 = 102122016242977 is a prime.
It is not a weakly prime, because it can be changed into another prime (102122033070193) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51061016510096 + 51061016510097.
It is an arithmetic number, because the mean of its divisors is an integer number (51061016510097).
Almost surely, 2102122033020193 is an apocalyptic number.
It is an amenable number.
102122033020193 is a deficient number, since it is larger than the sum of its proper divisors (1).
102122033020193 is an equidigital number, since it uses as much as digits as its factorization.
102122033020193 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 3888, while the sum is 29.
Adding to 102122033020193 its reverse (391020330221201), we get a palindrome (493142363241394).
The spelling of 102122033020193 in words is "one hundred two trillion, one hundred twenty-two billion, thirty-three million, twenty thousand, one hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •