Base | Representation |
---|---|
bin | 1000101001001010… |
… | …0011110110001111 |
3 | 12222200201100222222 |
4 | 2022102203312033 |
5 | 14222422334411 |
6 | 1022120125555 |
7 | 111331463561 |
oct | 21222436617 |
9 | 5880640888 |
10 | 2320121231 |
11 | a9071446a |
12 | 5490068bb |
13 | 2ac89b7cc |
14 | 1801c9331 |
15 | d8a484db |
hex | 8a4a3d8f |
2320121231 has 2 divisors, whose sum is σ = 2320121232. Its totient is φ = 2320121230.
The previous prime is 2320121227. The next prime is 2320121233. The reversal of 2320121231 is 1321210232.
2320121231 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 2320121231 - 22 = 2320121227 is a prime.
It is a super-2 number, since 2×23201212312 = 10765925053073910722, which contains 22 as substring.
Together with 2320121233, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2320121233) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1160060615 + 1160060616.
It is an arithmetic number, because the mean of its divisors is an integer number (1160060616).
Almost surely, 22320121231 is an apocalyptic number.
2320121231 is a deficient number, since it is larger than the sum of its proper divisors (1).
2320121231 is an equidigital number, since it uses as much as digits as its factorization.
2320121231 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 144, while the sum is 17.
The square root of 2320121231 is about 48167.6367595505. The cubic root of 2320121231 is about 1323.8442478482.
Adding to 2320121231 its reverse (1321210232), we get a palindrome (3641331463).
The spelling of 2320121231 in words is "two billion, three hundred twenty million, one hundred twenty-one thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •