Base | Representation |
---|---|
bin | 1001001011010110… |
… | …11110101001111001 |
3 | 110201101020201210112 |
4 | 10211223132221321 |
5 | 40042320401131 |
6 | 2132525154105 |
7 | 233045563202 |
oct | 44553365171 |
9 | 13641221715 |
10 | 4927122041 |
11 | 20a9260796 |
12 | b560bb935 |
13 | 606a2313a |
14 | 34a5305a9 |
15 | 1dc85d02b |
hex | 125adea79 |
4927122041 has 2 divisors, whose sum is σ = 4927122042. Its totient is φ = 4927122040.
The previous prime is 4927122029. The next prime is 4927122043. The reversal of 4927122041 is 1402217294.
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., 4306115641 + 621006400 = 65621^2 + 24920^2 .
It is a cyclic number.
It is not a de Polignac number, because 4927122041 - 230 = 3853380217 is a prime.
Together with 4927122043, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 4927121989 and 4927122007.
It is not a weakly prime, because it can be changed into another prime (4927122043) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2463561020 + 2463561021.
It is an arithmetic number, because the mean of its divisors is an integer number (2463561021).
Almost surely, 24927122041 is an apocalyptic number.
It is an amenable number.
4927122041 is a deficient number, since it is larger than the sum of its proper divisors (1).
4927122041 is an equidigital number, since it uses as much as digits as its factorization.
4927122041 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 8064, while the sum is 32.
The square root of 4927122041 is about 70193.4615259855. The cubic root of 4927122041 is about 1701.6272816216.
The spelling of 4927122041 in words is "four billion, nine hundred twenty-seven million, one hundred twenty-two thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •