Base | Representation |
---|---|
bin | 110100010111011110001000… |
… | …000000011001111101010011 |
3 | 1010012110112202101212221110002 |
4 | 310113132020000121331103 |
5 | 220141410032124333412 |
6 | 2133455320121200215 |
7 | 66340305016620641 |
oct | 6427361000317523 |
9 | 1105415671787402 |
10 | 230311313121107 |
11 | 67425530064a69 |
12 | 219b7a6093006b |
13 | 9b6835729751a |
14 | 40c31ac810191 |
15 | 1b95dd4817dc2 |
hex | d17788019f53 |
230311313121107 has 2 divisors, whose sum is σ = 230311313121108. Its totient is φ = 230311313121106.
The previous prime is 230311313121073. The next prime is 230311313121161. The reversal of 230311313121107 is 701121313113032.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 230311313121107 - 28 = 230311313120851 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 230311313121107.
It is not a weakly prime, because it can be changed into another prime (230311313121707) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 115155656560553 + 115155656560554.
It is an arithmetic number, because the mean of its divisors is an integer number (115155656560554).
Almost surely, 2230311313121107 is an apocalyptic number.
230311313121107 is a deficient number, since it is larger than the sum of its proper divisors (1).
230311313121107 is an equidigital number, since it uses as much as digits as its factorization.
230311313121107 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2268, while the sum is 29.
Adding to 230311313121107 its reverse (701121313113032), we get a palindrome (931432626234139).
The spelling of 230311313121107 in words is "two hundred thirty trillion, three hundred eleven billion, three hundred thirteen million, one hundred twenty-one thousand, one hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •