Base | Representation |
---|---|
bin | 1011010000000001… |
… | …1110000101010101 |
3 | 21210110201000111102 |
4 | 2310000132011111 |
5 | 22141111201401 |
6 | 1215401315445 |
7 | 134560523105 |
oct | 26400360525 |
9 | 7713630442 |
10 | 3020022101 |
11 | 130a7a6338 |
12 | 703495b85 |
13 | 3918a4a35 |
14 | 209139205 |
15 | 12a1eb56b |
hex | b401e155 |
3020022101 has 4 divisors (see below), whose sum is σ = 3022022304. Its totient is φ = 3018021900.
The previous prime is 3020022091. The next prime is 3020022113. The reversal of 3020022101 is 1012200203.
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.
It is a cyclic number.
It is not a de Polignac number, because 3020022101 - 210 = 3020021077 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3020022121) 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 in 3 ways as a sum of consecutive naturals, for example, 997835 + ... + 1000856.
It is an arithmetic number, because the mean of its divisors is an integer number (755505576).
Almost surely, 23020022101 is an apocalyptic number.
It is an amenable number.
3020022101 is a deficient number, since it is larger than the sum of its proper divisors (2000203).
3020022101 is a wasteful number, since it uses less digits than its factorization.
3020022101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2000202.
The product of its (nonzero) digits is 24, while the sum is 11.
The square root of 3020022101 is about 54954.7277402045. The cubic root of 3020022101 is about 1445.4509994161.
Adding to 3020022101 its reverse (1012200203), we get a palindrome (4032222304).
The spelling of 3020022101 in words is "three billion, twenty million, twenty-two thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •