Base | Representation |
---|---|
bin | 111101011011101… |
… | …0101001101000111 |
3 | 12022122202011111002 |
4 | 1322313111031013 |
5 | 13210144401002 |
6 | 540313203515 |
7 | 102036655151 |
oct | 17267251507 |
9 | 5278664432 |
10 | 2061325127 |
11 | 968623094 |
12 | 49640059b |
13 | 26b099514 |
14 | 157a9dad1 |
15 | c0e78002 |
hex | 7add5347 |
2061325127 has 2 divisors, whose sum is σ = 2061325128. Its totient is φ = 2061325126.
The previous prime is 2061325109. The next prime is 2061325141. The reversal of 2061325127 is 7215231602.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2061325127 is a prime.
It is a super-2 number, since 2×20613251272 = 8498122558403132258, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 2061325127.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2061325177) 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, 1030662563 + 1030662564.
It is an arithmetic number, because the mean of its divisors is an integer number (1030662564).
Almost surely, 22061325127 is an apocalyptic number.
2061325127 is a deficient number, since it is larger than the sum of its proper divisors (1).
2061325127 is an equidigital number, since it uses as much as digits as its factorization.
2061325127 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5040, while the sum is 29.
The square root of 2061325127 is about 45401.8185428734. The cubic root of 2061325127 is about 1272.6690981506.
Adding to 2061325127 its reverse (7215231602), we get a palindrome (9276556729).
The spelling of 2061325127 in words is "two billion, sixty-one million, three hundred twenty-five thousand, one hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •