Base | Representation |
---|---|
bin | 11101110110011000000… |
… | …101110000011011000001 |
3 | 21021002122012201202011222 |
4 | 131312120011300123001 |
5 | 232101430231433311 |
6 | 4210155352444425 |
7 | 301124625131336 |
oct | 35663005603301 |
9 | 7232565652158 |
10 | 2051251046081 |
11 | 720a26815316 |
12 | 2916679a9715 |
13 | 11b58055bb43 |
14 | 713d13da98d |
15 | 385575e2adb |
hex | 1dd981706c1 |
2051251046081 has 2 divisors, whose sum is σ = 2051251046082. Its totient is φ = 2051251046080.
The previous prime is 2051251046071. The next prime is 2051251046123. The reversal of 2051251046081 is 1806401521502.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 2029032162481 + 22218883600 = 1424441^2 + 149060^2 .
It is a cyclic number.
It is not a de Polignac number, because 2051251046081 - 226 = 2051183937217 is a prime.
It is a super-2 number, since 2×20512510460812 (a number of 25 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (2051251046071) 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, 1025625523040 + 1025625523041.
It is an arithmetic number, because the mean of its divisors is an integer number (1025625523041).
Almost surely, 22051251046081 is an apocalyptic number.
It is an amenable number.
2051251046081 is a deficient number, since it is larger than the sum of its proper divisors (1).
2051251046081 is an equidigital number, since it uses as much as digits as its factorization.
2051251046081 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 19200, while the sum is 35.
Adding to 2051251046081 its reverse (1806401521502), we get a palindrome (3857652567583).
The spelling of 2051251046081 in words is "two trillion, fifty-one billion, two hundred fifty-one million, forty-six thousand, eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •