Base | Representation |
---|---|
bin | 1000101011100001… |
… | …0111010000001001 |
3 | 20000101100211210122 |
4 | 2022320113100021 |
5 | 14232441443423 |
6 | 1023112353025 |
7 | 111511636424 |
oct | 21270272011 |
9 | 6011324718 |
10 | 2330031113 |
11 | a96272953 |
12 | 5503a5775 |
13 | 2b195b347 |
14 | 1816489bb |
15 | d98548c8 |
hex | 8ae17409 |
2330031113 has 2 divisors, whose sum is σ = 2330031114. Its totient is φ = 2330031112.
The previous prime is 2330031097. The next prime is 2330031163. The reversal of 2330031113 is 3111300332.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1211596864 + 1118434249 = 34808^2 + 33443^2 .
It is a cyclic number.
It is not a de Polignac number, because 2330031113 - 24 = 2330031097 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2330031091 and 2330031100.
It is not a weakly prime, because it can be changed into another prime (2330031163) 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, 1165015556 + 1165015557.
It is an arithmetic number, because the mean of its divisors is an integer number (1165015557).
Almost surely, 22330031113 is an apocalyptic number.
It is an amenable number.
2330031113 is a deficient number, since it is larger than the sum of its proper divisors (1).
2330031113 is an equidigital number, since it uses as much as digits as its factorization.
2330031113 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 162, while the sum is 17.
The square root of 2330031113 is about 48270.3958239416. The cubic root of 2330031113 is about 1325.7264061032.
Adding to 2330031113 its reverse (3111300332), we get a palindrome (5441331445).
The spelling of 2330031113 in words is "two billion, three hundred thirty million, thirty-one thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •