Base | Representation |
---|---|
bin | 10111001110001110001101… |
… | …101011001001110001011101 |
3 | 111101121202120212002020010212 |
4 | 113032032031223021301131 |
5 | 101341314130440400021 |
6 | 1001114551225542205 |
7 | 30340552121063255 |
oct | 2716161553116135 |
9 | 441552525066125 |
10 | 102132404231261 |
11 | 2a5a7122669678 |
12 | b555b3b644965 |
13 | 44cb0766bc691 |
14 | 1b313401ac965 |
15 | bc1a7172085b |
hex | 5ce38dac9c5d |
102132404231261 has 2 divisors, whose sum is σ = 102132404231262. Its totient is φ = 102132404231260.
The previous prime is 102132404231257. The next prime is 102132404231287. The reversal of 102132404231261 is 162132404231201.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 99386324394361 + 2746079836900 = 9969269^2 + 1657130^2 .
It is a cyclic number.
It is not a de Polignac number, because 102132404231261 - 22 = 102132404231257 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 (102132404231861) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51066202115630 + 51066202115631.
It is an arithmetic number, because the mean of its divisors is an integer number (51066202115631).
Almost surely, 2102132404231261 is an apocalyptic number.
It is an amenable number.
102132404231261 is a deficient number, since it is larger than the sum of its proper divisors (1).
102132404231261 is an equidigital number, since it uses as much as digits as its factorization.
102132404231261 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 13824, while the sum is 32.
Adding to 102132404231261 its reverse (162132404231201), we get a palindrome (264264808462462).
The spelling of 102132404231261 in words is "one hundred two trillion, one hundred thirty-two billion, four hundred four million, two hundred thirty-one thousand, two hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •