Base | Representation |
---|---|
bin | 11011100100000… |
… | …00110100101101 |
3 | 121010001220111121 |
4 | 31302000310231 |
5 | 433142330011 |
6 | 34535420541 |
7 | 5505201256 |
oct | 1562006455 |
9 | 533056447 |
10 | 231214381 |
11 | 109572872 |
12 | 65524751 |
13 | 38b95c58 |
14 | 229c9b2d |
15 | 15472e71 |
hex | dc80d2d |
231214381 has 2 divisors, whose sum is σ = 231214382. Its totient is φ = 231214380.
The previous prime is 231214367. The next prime is 231214391. The reversal of 231214381 is 183412132.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 209265156 + 21949225 = 14466^2 + 4685^2 .
It is a cyclic number.
It is not a de Polignac number, because 231214381 - 217 = 231083309 is a prime.
It is a super-2 number, since 2×2312143812 = 106920179962426322, which contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (231214391) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 115607190 + 115607191.
It is an arithmetic number, because the mean of its divisors is an integer number (115607191).
Almost surely, 2231214381 is an apocalyptic number.
It is an amenable number.
231214381 is a deficient number, since it is larger than the sum of its proper divisors (1).
231214381 is an equidigital number, since it uses as much as digits as its factorization.
231214381 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 1152, while the sum is 25.
The square root of 231214381 is about 15205.7351351390. The cubic root of 231214381 is about 613.7689973007.
It can be divided in two parts, 23 and 1214381, that added together give a square (1214404 = 11022).
The spelling of 231214381 in words is "two hundred thirty-one million, two hundred fourteen thousand, three hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •