Base | Representation |
---|---|
bin | 1000101001110110… |
… | …0011001100000001 |
3 | 12222220010201211022 |
4 | 2022131203030001 |
5 | 14224142031423 |
6 | 1022301555225 |
7 | 111365122625 |
oct | 21235431401 |
9 | 5886121738 |
10 | 2323002113 |
11 | a92301963 |
12 | 549b75b15 |
13 | 2b0369b83 |
14 | 180739185 |
15 | d8e16dc8 |
hex | 8a763301 |
2323002113 has 2 divisors, whose sum is σ = 2323002114. Its totient is φ = 2323002112.
The previous prime is 2323002049. The next prime is 2323002151. The reversal of 2323002113 is 3112003232.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2081914384 + 241087729 = 45628^2 + 15527^2 .
It is a cyclic number.
It is not a de Polignac number, because 2323002113 - 26 = 2323002049 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2323002091 and 2323002100.
It is not a weakly prime, because it can be changed into another prime (2323002713) 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, 1161501056 + 1161501057.
It is an arithmetic number, because the mean of its divisors is an integer number (1161501057).
Almost surely, 22323002113 is an apocalyptic number.
It is an amenable number.
2323002113 is a deficient number, since it is larger than the sum of its proper divisors (1).
2323002113 is an equidigital number, since it uses as much as digits as its factorization.
2323002113 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 216, while the sum is 17.
The square root of 2323002113 is about 48197.5322293580. The cubic root of 2323002113 is about 1324.3919579651.
Adding to 2323002113 its reverse (3112003232), we get a palindrome (5435005345).
The spelling of 2323002113 in words is "two billion, three hundred twenty-three million, two thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •