Base | Representation |
---|---|
bin | 1000100100110111… |
… | …1011101110101001 |
3 | 12221102212101012022 |
4 | 2021031323232221 |
5 | 14203321143423 |
6 | 1020234354225 |
7 | 111022535342 |
oct | 21115735651 |
9 | 5842771168 |
10 | 2302131113 |
11 | a815471a7 |
12 | 542b8b975 |
13 | 2a8c40179 |
14 | 17ba650c9 |
15 | d7192dc8 |
hex | 8937bba9 |
2302131113 has 2 divisors, whose sum is σ = 2302131114. Its totient is φ = 2302131112.
The previous prime is 2302131079. The next prime is 2302131127. The reversal of 2302131113 is 3111312032.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2082735769 + 219395344 = 45637^2 + 14812^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2302131113 is a prime.
It is a super-2 number, since 2×23021311132 = 10599615322885237538, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 2302131091 and 2302131100.
It is not a weakly prime, because it can be changed into another prime (2302131133) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1151065556 + 1151065557.
It is an arithmetic number, because the mean of its divisors is an integer number (1151065557).
Almost surely, 22302131113 is an apocalyptic number.
It is an amenable number.
2302131113 is a deficient number, since it is larger than the sum of its proper divisors (1).
2302131113 is an equidigital number, since it uses as much as digits as its factorization.
2302131113 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 108, while the sum is 17.
The square root of 2302131113 is about 47980.5284777065. The cubic root of 2302131113 is about 1320.4136890152.
Adding to 2302131113 its reverse (3111312032), we get a palindrome (5413443145).
The spelling of 2302131113 in words is "two billion, three hundred two million, one hundred thirty-one thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •