Base | Representation |
---|---|
bin | 1011010000000001… |
… | …1101110110000011 |
3 | 21210110200222011012 |
4 | 2310000131312003 |
5 | 22141111133443 |
6 | 1215401311135 |
7 | 134560520210 |
oct | 26400356603 |
9 | 7713628135 |
10 | 3020021123 |
11 | 130a7a5629 |
12 | 7034954ab |
13 | 3918a4462 |
14 | 209138b07 |
15 | 12a1eb118 |
hex | b401dd83 |
3020021123 has 8 divisors (see below), whose sum is σ = 3508034400. Its totient is φ = 2546153280.
The previous prime is 3020021113. The next prime is 3020021159. The reversal of 3020021123 is 3211200203.
It is a happy number.
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 3020021123 - 28 = 3020020867 is a prime.
It is a super-2 number, since 2×30200211232 = 18241055166732362258, 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 = 3020021098 and 3020021107.
It is not an unprimeable number, because it can be changed into a prime (3020021113) 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, 3535898 + ... + 3536751.
It is an arithmetic number, because the mean of its divisors is an integer number (438504300).
Almost surely, 23020021123 is an apocalyptic number.
3020021123 is a deficient number, since it is larger than the sum of its proper divisors (488013277).
3020021123 is an equidigital number, since it uses as much as digits as its factorization.
3020021123 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7072717.
The product of its (nonzero) digits is 72, while the sum is 14.
The square root of 3020021123 is about 54954.7188419702. The cubic root of 3020021123 is about 1445.4508433851.
Adding to 3020021123 its reverse (3211200203), we get a palindrome (6231221326).
The spelling of 3020021123 in words is "three billion, twenty million, twenty-one thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.102 sec. • engine limits •