Base | Representation |
---|---|
bin | 1011010001101100… |
… | …0111001010101001 |
3 | 21210221211211202211 |
4 | 2310123013022221 |
5 | 22144403143441 |
6 | 1220211125121 |
7 | 135004061506 |
oct | 26433071251 |
9 | 7727754684 |
10 | 3027006121 |
11 | 1313736557 |
12 | 7058a37a1 |
13 | 39317b8a9 |
14 | 20a0364ad |
15 | 12ab2aa81 |
hex | b46c72a9 |
3027006121 has 2 divisors, whose sum is σ = 3027006122. Its totient is φ = 3027006120.
The previous prime is 3027006089. The next prime is 3027006131. The reversal of 3027006121 is 1216007203.
3027006121 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2989355625 + 37650496 = 54675^2 + 6136^2 .
It is an emirp because it is prime and its reverse (1216007203) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 3027006121 - 25 = 3027006089 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 3027006092 and 3027006101.
It is not a weakly prime, because it can be changed into another prime (3027006131) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1513503060 + 1513503061.
It is an arithmetic number, because the mean of its divisors is an integer number (1513503061).
Almost surely, 23027006121 is an apocalyptic number.
It is an amenable number.
3027006121 is a deficient number, since it is larger than the sum of its proper divisors (1).
3027006121 is an equidigital number, since it uses as much as digits as its factorization.
3027006121 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 504, while the sum is 22.
The square root of 3027006121 is about 55018.2344409560. The cubic root of 3027006121 is about 1446.5643783343.
The spelling of 3027006121 in words is "three billion, twenty-seven million, six thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •