Base | Representation |
---|---|
bin | 1000101001011001… |
… | …0110010001110111 |
3 | 12222202120211010202 |
4 | 2022112112101313 |
5 | 14223201123411 |
6 | 1022153311115 |
7 | 111343100612 |
oct | 21226262167 |
9 | 5882524122 |
10 | 2321114231 |
11 | a91232527 |
12 | 54940549b |
13 | 2acb58797 |
14 | 1803a7179 |
15 | d8b9283b |
hex | 8a596477 |
2321114231 has 2 divisors, whose sum is σ = 2321114232. Its totient is φ = 2321114230.
The previous prime is 2321114197. The next prime is 2321114269. The reversal of 2321114231 is 1324111232.
2321114231 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 2321114231 - 230 = 1247372407 is a prime.
It is a super-2 number, since 2×23211142312 = 10775142546701442722, which contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2321114291) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1160557115 + 1160557116.
It is an arithmetic number, because the mean of its divisors is an integer number (1160557116).
Almost surely, 22321114231 is an apocalyptic number.
2321114231 is a deficient number, since it is larger than the sum of its proper divisors (1).
2321114231 is an equidigital number, since it uses as much as digits as its factorization.
2321114231 is an evil number, because the sum of its binary digits is even.
The product of its digits is 288, while the sum is 20.
The square root of 2321114231 is about 48177.9434077462. The cubic root of 2321114231 is about 1324.0330870952.
Adding to 2321114231 its reverse (1324111232), we get a palindrome (3645225463).
Subtracting from 2321114231 its reverse (1324111232), we obtain a cube (997002999 = 9993).
The spelling of 2321114231 in words is "two billion, three hundred twenty-one million, one hundred fourteen thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •