Base | Representation |
---|---|
bin | 1011010000000011… |
… | …0110010001111011 |
3 | 21210110220001110011 |
4 | 2310000312101323 |
5 | 22141122334321 |
6 | 1215403402351 |
7 | 134561415052 |
oct | 26400662173 |
9 | 7713801404 |
10 | 3020121211 |
11 | 130a863848 |
12 | 7035233b7 |
13 | 39190ab93 |
14 | 209163399 |
15 | 12a21aae1 |
hex | b403647b |
3020121211 has 8 divisors (see below), whose sum is σ = 3091438064. Its totient is φ = 2948853600.
The previous prime is 3020121199. The next prime is 3020121217. The reversal of 3020121211 is 1121210203.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 3020121211 - 215 = 3020088443 is a prime.
It is a super-2 number, since 2×30201212112 = 18242264258264213042, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 3020121191 and 3020121200.
It is not an unprimeable number, because it can be changed into a prime (3020121217) 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, 131305 + ... + 152581.
It is an arithmetic number, because the mean of its divisors is an integer number (386429758).
Almost surely, 23020121211 is an apocalyptic number.
3020121211 is a deficient number, since it is larger than the sum of its proper divisors (71316853).
3020121211 is a wasteful number, since it uses less digits than its factorization.
3020121211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 24621.
The product of its (nonzero) digits is 24, while the sum is 13.
The square root of 3020121211 is about 54955.6294750592. The cubic root of 3020121211 is about 1445.4668113402.
Adding to 3020121211 its reverse (1121210203), we get a palindrome (4141331414).
The spelling of 3020121211 in words is "three billion, twenty million, one hundred twenty-one thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •