Base | Representation |
---|---|
bin | 10111001111101011000100… |
… | …100111010110111001011011 |
3 | 111101222021221112111211000212 |
4 | 113033223010213112321123 |
5 | 101344432330204344011 |
6 | 1001232441051321335 |
7 | 30351011665101446 |
oct | 2717530447267133 |
9 | 441867845454025 |
10 | 102232110231131 |
11 | 2a635438049061 |
12 | b571326a5024b |
13 | 45075a632223a |
14 | 1b360bc17c65d |
15 | bc4459c3408b |
hex | 5cfac49d6e5b |
102232110231131 has 2 divisors, whose sum is σ = 102232110231132. Its totient is φ = 102232110231130.
The previous prime is 102232110231109. The next prime is 102232110231151. The reversal of 102232110231131 is 131132011232201.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 102232110231131 - 214 = 102232110214747 is a prime.
It is a super-2 number, since 2×1022321102311312 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 102232110231097 and 102232110231106.
It is not a weakly prime, because it can be changed into another prime (102232110231151) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51116055115565 + 51116055115566.
It is an arithmetic number, because the mean of its divisors is an integer number (51116055115566).
Almost surely, 2102232110231131 is an apocalyptic number.
102232110231131 is a deficient number, since it is larger than the sum of its proper divisors (1).
102232110231131 is an equidigital number, since it uses as much as digits as its factorization.
102232110231131 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 432, while the sum is 23.
Adding to 102232110231131 its reverse (131132011232201), we get a palindrome (233364121463332).
The spelling of 102232110231131 in words is "one hundred two trillion, two hundred thirty-two billion, one hundred ten million, two hundred thirty-one thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •