Base | Representation |
---|---|
bin | 10111001111101011000100… |
… | …100111010110101100110011 |
3 | 111101222021221112111202220221 |
4 | 113033223010213112230303 |
5 | 101344432330204332243 |
6 | 1001232441051313511 |
7 | 30351011665066213 |
oct | 2717530447265463 |
9 | 441867845452827 |
10 | 102232110230323 |
11 | 2a635438048497 |
12 | b571326a4b897 |
13 | 45075a6321a68 |
14 | 1b360bc17c243 |
15 | bc4459c33bed |
hex | 5cfac49d6b33 |
102232110230323 has 2 divisors, whose sum is σ = 102232110230324. Its totient is φ = 102232110230322.
The previous prime is 102232110230143. The next prime is 102232110230381. The reversal of 102232110230323 is 323032011232201.
It is a strong prime.
It is an emirp because it is prime and its reverse (323032011232201) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-102232110230323 is a prime.
It is a super-2 number, since 2×1022321102303232 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (102232110230023) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51116055115161 + 51116055115162.
It is an arithmetic number, because the mean of its divisors is an integer number (51116055115162).
Almost surely, 2102232110230323 is an apocalyptic number.
102232110230323 is a deficient number, since it is larger than the sum of its proper divisors (1).
102232110230323 is an equidigital number, since it uses as much as digits as its factorization.
102232110230323 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 25.
Adding to 102232110230323 its reverse (323032011232201), we get a palindrome (425264121462524).
The spelling of 102232110230323 in words is "one hundred two trillion, two hundred thirty-two billion, one hundred ten million, two hundred thirty thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •