Base | Representation |
---|---|
bin | 1011001011100010… |
… | …1101100010101101 |
3 | 21202011022022120221 |
4 | 2302320231202231 |
5 | 22121302223203 |
6 | 1213450211341 |
7 | 134241605311 |
oct | 26270554255 |
9 | 7664268527 |
10 | 3001211053 |
11 | 1300118315 |
12 | 6b9123b51 |
13 | 38aa19839 |
14 | 20683db41 |
15 | 128732abd |
hex | b2e2d8ad |
3001211053 has 2 divisors, whose sum is σ = 3001211054. Its totient is φ = 3001211052.
The previous prime is 3001211009. The next prime is 3001211089. The reversal of 3001211053 is 3501121003.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1653072964 + 1348138089 = 40658^2 + 36717^2 .
It is an emirp because it is prime and its reverse (3501121003) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-3001211053 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (3001211753) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1500605526 + 1500605527.
It is an arithmetic number, because the mean of its divisors is an integer number (1500605527).
Almost surely, 23001211053 is an apocalyptic number.
It is an amenable number.
3001211053 is a deficient number, since it is larger than the sum of its proper divisors (1).
3001211053 is an equidigital number, since it uses as much as digits as its factorization.
3001211053 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 90, while the sum is 16.
The square root of 3001211053 is about 54783.3099857977. The cubic root of 3001211053 is about 1442.4436153842.
Adding to 3001211053 its reverse (3501121003), we get a palindrome (6502332056).
The spelling of 3001211053 in words is "three billion, one million, two hundred eleven thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •