Base | Representation |
---|---|
bin | 1000101011100010… |
… | …1000010101111001 |
3 | 20000101111101211020 |
4 | 2022320220111321 |
5 | 14233001213423 |
6 | 1023114053053 |
7 | 111512350464 |
oct | 21270502571 |
9 | 6011441736 |
10 | 2330101113 |
11 | a963104aa |
12 | 55041a189 |
13 | 2b1984172 |
14 | 1816662db |
15 | d986a4e3 |
hex | 8ae28579 |
2330101113 has 8 divisors (see below), whose sum is σ = 3107106528. Its totient is φ = 1553248224.
The previous prime is 2330101099. The next prime is 2330101127. The reversal of 2330101113 is 3111010332.
It is an interprime number because it is at equal distance from previous prime (2330101099) and next prime (2330101127).
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 2330101113 - 29 = 2330100601 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 2330101092 and 2330101101.
It is not an unprimeable number, because it can be changed into a prime (2330101133) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4245 + ... + 68397.
It is an arithmetic number, because the mean of its divisors is an integer number (388388316).
Almost surely, 22330101113 is an apocalyptic number.
It is an amenable number.
2330101113 is a deficient number, since it is larger than the sum of its proper divisors (777005415).
2330101113 is a wasteful number, since it uses less digits than its factorization.
2330101113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 76263.
The product of its (nonzero) digits is 54, while the sum is 15.
The square root of 2330101113 is about 48271.1209005965. The cubic root of 2330101113 is about 1325.7396820231.
Adding to 2330101113 its reverse (3111010332), we get a palindrome (5441111445).
The spelling of 2330101113 in words is "two billion, three hundred thirty million, one hundred one thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •