Base | Representation |
---|---|
bin | 1011010000000100… |
… | …1010000010000001 |
3 | 21210111001011102112 |
4 | 2310001022002001 |
5 | 22141132431423 |
6 | 1215405225105 |
7 | 134562202655 |
oct | 26401120201 |
9 | 7714034375 |
10 | 3020202113 |
11 | 130a909605 |
12 | 703562195 |
13 | 391938956 |
14 | 209184a65 |
15 | 12a234a78 |
hex | b404a081 |
3020202113 has 4 divisors (see below), whose sum is σ = 3043983360. Its totient is φ = 2996420868.
The previous prime is 3020202041. The next prime is 3020202161. The reversal of 3020202113 is 3112020203.
It is a happy number.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 3112020203 = 19 ⋅163790537.
It is a cyclic number.
It is not a de Polignac number, because 3020202113 - 28 = 3020201857 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (3020202173) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 11890433 + ... + 11890686.
It is an arithmetic number, because the mean of its divisors is an integer number (760995840).
Almost surely, 23020202113 is an apocalyptic number.
It is an amenable number.
3020202113 is a deficient number, since it is larger than the sum of its proper divisors (23781247).
3020202113 is a wasteful number, since it uses less digits than its factorization.
3020202113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 23781246.
The product of its (nonzero) digits is 72, while the sum is 14.
The square root of 3020202113 is about 54956.3655366692. The cubic root of 3020202113 is about 1445.4797181193.
Adding to 3020202113 its reverse (3112020203), we get a palindrome (6132222316).
The spelling of 3020202113 in words is "three billion, twenty million, two hundred two thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •