Base | Representation |
---|---|
bin | 10111001110001101111011… |
… | …101011000010001011110101 |
3 | 111101121201210210202222021002 |
4 | 113032031323223002023311 |
5 | 101341313021131212133 |
6 | 1001114501240333045 |
7 | 30340541462665541 |
oct | 2716157353021365 |
9 | 441551723688232 |
10 | 102132102210293 |
11 | 2a5a6a88134871 |
12 | b555a76474185 |
13 | 44cb028c64a4c |
14 | 1b31312030a21 |
15 | bc1a54e62ce8 |
hex | 5ce37bac22f5 |
102132102210293 has 2 divisors, whose sum is σ = 102132102210294. Its totient is φ = 102132102210292.
The previous prime is 102132102210287. The next prime is 102132102210319. The reversal of 102132102210293 is 392012201231201.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 96591195798724 + 5540906411569 = 9828082^2 + 2353913^2 .
It is a cyclic number.
It is not a de Polignac number, because 102132102210293 - 226 = 102132035101429 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (102132102210223) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51066051105146 + 51066051105147.
It is an arithmetic number, because the mean of its divisors is an integer number (51066051105147).
Almost surely, 2102132102210293 is an apocalyptic number.
It is an amenable number.
102132102210293 is a deficient number, since it is larger than the sum of its proper divisors (1).
102132102210293 is an equidigital number, since it uses as much as digits as its factorization.
102132102210293 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2592, while the sum is 29.
Adding to 102132102210293 its reverse (392012201231201), we get a palindrome (494144303441494).
The spelling of 102132102210293 in words is "one hundred two trillion, one hundred thirty-two billion, one hundred two million, two hundred ten thousand, two hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •