Base | Representation |
---|---|
bin | 1011010110111101… |
… | …1100101000001001 |
3 | 21212111110001020122 |
4 | 2311233130220021 |
5 | 22221033122441 |
6 | 1222321033025 |
7 | 135363020354 |
oct | 26557345011 |
9 | 7774401218 |
10 | 3049114121 |
11 | 1325166629 |
12 | 711185775 |
13 | 39791c651 |
14 | 20cd4d29b |
15 | 12ca4634b |
hex | b5bdca09 |
3049114121 has 2 divisors, whose sum is σ = 3049114122. Its totient is φ = 3049114120.
The previous prime is 3049114087. The next prime is 3049114127. The reversal of 3049114121 is 1214119403.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2741988496 + 307125625 = 52364^2 + 17525^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-3049114121 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (3049114127) 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, 1524557060 + 1524557061.
It is an arithmetic number, because the mean of its divisors is an integer number (1524557061).
Almost surely, 23049114121 is an apocalyptic number.
It is an amenable number.
3049114121 is a deficient number, since it is larger than the sum of its proper divisors (1).
3049114121 is an equidigital number, since it uses as much as digits as its factorization.
3049114121 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 864, while the sum is 26.
The square root of 3049114121 is about 55218.7841318514. The cubic root of 3049114121 is about 1450.0775417906.
The spelling of 3049114121 in words is "three billion, forty-nine million, one hundred fourteen thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •