Base | Representation |
---|---|
bin | 10111001110001110000010… |
… | …111000101100100010000011 |
3 | 111101121202010020111112000101 |
4 | 113032032002320230202003 |
5 | 101341313243121412011 |
6 | 1001114521242303231 |
7 | 30340544462444101 |
oct | 2716160270544203 |
9 | 441552106445011 |
10 | 102132223232131 |
11 | 2a5a703a484314 |
12 | b555aaaab7b17 |
13 | 44cb048058ac1 |
14 | 1b31324134c71 |
15 | bc1a608bb2c1 |
hex | 5ce382e2c883 |
102132223232131 has 2 divisors, whose sum is σ = 102132223232132. Its totient is φ = 102132223232130.
The previous prime is 102132223232119. The next prime is 102132223232141. The reversal of 102132223232131 is 131232322231201.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 102132223232131 - 27 = 102132223232003 is a prime.
It is a super-2 number, since 2×1021322232321312 (a number of 29 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 102132223232131.
It is not a weakly prime, because it can be changed into another prime (102132223232141) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51066111616065 + 51066111616066.
It is an arithmetic number, because the mean of its divisors is an integer number (51066111616066).
Almost surely, 2102132223232131 is an apocalyptic number.
102132223232131 is a deficient number, since it is larger than the sum of its proper divisors (1).
102132223232131 is an equidigital number, since it uses as much as digits as its factorization.
102132223232131 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5184, while the sum is 28.
Adding to 102132223232131 its reverse (131232322231201), we get a palindrome (233364545463332).
The spelling of 102132223232131 in words is "one hundred two trillion, one hundred thirty-two billion, two hundred twenty-three million, two hundred thirty-two thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •