Base | Representation |
---|---|
bin | 1101011001010011100… |
… | …1000000000111110111 |
3 | 211000000020112010200202 |
4 | 3112110321000013313 |
5 | 12232302044043432 |
6 | 253415411031115 |
7 | 22424603146043 |
oct | 3262471000767 |
9 | 730006463622 |
10 | 230131237367 |
11 | 896640a1869 |
12 | 3872659b49b |
13 | 18916944005 |
14 | b1d1b2d023 |
15 | 5ebd873462 |
hex | 3594e401f7 |
230131237367 has 2 divisors, whose sum is σ = 230131237368. Its totient is φ = 230131237366.
The previous prime is 230131237339. The next prime is 230131237381. The reversal of 230131237367 is 763732131032.
230131237367 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 230131237367 - 212 = 230131233271 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 230131237367.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (230131237307) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 115065618683 + 115065618684.
It is an arithmetic number, because the mean of its divisors is an integer number (115065618684).
Almost surely, 2230131237367 is an apocalyptic number.
230131237367 is a deficient number, since it is larger than the sum of its proper divisors (1).
230131237367 is an equidigital number, since it uses as much as digits as its factorization.
230131237367 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 95256, while the sum is 38.
Adding to 230131237367 its reverse (763732131032), we get a palindrome (993863368399).
The spelling of 230131237367 in words is "two hundred thirty billion, one hundred thirty-one million, two hundred thirty-seven thousand, three hundred sixty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •