Base | Representation |
---|---|
bin | 1011001100100100… |
… | …01001100100100001 |
3 | 120111220202111101011 |
4 | 11212102021210201 |
5 | 44302304013441 |
6 | 2432244340521 |
7 | 301646444416 |
oct | 54622114441 |
9 | 16456674334 |
10 | 6011001121 |
11 | 2605065124 |
12 | 11b90a4741 |
13 | 74a44b1c8 |
14 | 41047410d |
15 | 252aac581 |
hex | 166489921 |
6011001121 has 2 divisors, whose sum is σ = 6011001122. Its totient is φ = 6011001120.
The previous prime is 6011001097. The next prime is 6011001149. The reversal of 6011001121 is 1211001106.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 5135728896 + 875272225 = 71664^2 + 29585^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-6011001121 is a prime.
It is a super-2 number, since 2×60110011212 = 72264268953326513282, which contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (6011001181) 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 as a sum of consecutive naturals, namely, 3005500560 + 3005500561.
It is an arithmetic number, because the mean of its divisors is an integer number (3005500561).
Almost surely, 26011001121 is an apocalyptic number.
It is an amenable number.
6011001121 is a deficient number, since it is larger than the sum of its proper divisors (1).
6011001121 is an equidigital number, since it uses as much as digits as its factorization.
6011001121 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 12, while the sum is 13.
The square root of 6011001121 is about 77530.6463342077. The cubic root of 6011001121 is about 1818.2304905191.
Adding to 6011001121 its reverse (1211001106), we get a palindrome (7222002227).
The spelling of 6011001121 in words is "six billion, eleven million, one thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •