Base | Representation |
---|---|
bin | 1011010000110000… |
… | …1101100100110101 |
3 | 21210200111101212120 |
4 | 2310030031210311 |
5 | 22142403201323 |
6 | 1215551310153 |
7 | 134625633150 |
oct | 26414154465 |
9 | 7720441776 |
10 | 3023100213 |
11 | 1311508a31 |
12 | 70451b359 |
13 | 392411ac3 |
14 | 2096dac97 |
15 | 12a6085e3 |
hex | b430d935 |
3023100213 has 8 divisors (see below), whose sum is σ = 4606628928. Its totient is φ = 1727485824.
The previous prime is 3023100209. The next prime is 3023100217. The reversal of 3023100213 is 3120013203.
It is an interprime number because it is at equal distance from previous prime (3023100209) and next prime (3023100217).
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 3023100213 - 22 = 3023100209 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 3023100192 and 3023100201.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3023100217) 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, 71978556 + ... + 71978597.
It is an arithmetic number, because the mean of its divisors is an integer number (575828616).
Almost surely, 23023100213 is an apocalyptic number.
It is an amenable number.
3023100213 is a deficient number, since it is larger than the sum of its proper divisors (1583528715).
3023100213 is a wasteful number, since it uses less digits than its factorization.
3023100213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 143957163.
The product of its (nonzero) digits is 108, while the sum is 15.
The square root of 3023100213 is about 54982.7264966007. The cubic root of 3023100213 is about 1445.9419173806.
Adding to 3023100213 its reverse (3120013203), we get a palindrome (6143113416).
The spelling of 3023100213 in words is "three billion, twenty-three million, one hundred thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •