Base | Representation |
---|---|
bin | 111101001001000… |
… | …0100001011001001 |
3 | 12021222100211211002 |
4 | 1322102010023021 |
5 | 13200144243131 |
6 | 535323544345 |
7 | 101560636643 |
oct | 17222041311 |
9 | 5258324732 |
10 | 2051556041 |
11 | 963060467 |
12 | 49308b0b5 |
13 | 269058ab2 |
14 | 156679893 |
15 | c01986cb |
hex | 7a4842c9 |
2051556041 has 4 divisors (see below), whose sum is σ = 2052042000. Its totient is φ = 2051070084.
The previous prime is 2051556029. The next prime is 2051556049. The reversal of 2051556041 is 1406551502.
It is a happy number.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 2051556041 - 214 = 2051539657 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2051555995 and 2051556013.
It is not an unprimeable number, because it can be changed into a prime (2051556049) 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 in 3 ways as a sum of consecutive naturals, for example, 236591 + ... + 245108.
It is an arithmetic number, because the mean of its divisors is an integer number (513010500).
Almost surely, 22051556041 is an apocalyptic number.
It is an amenable number.
2051556041 is a deficient number, since it is larger than the sum of its proper divisors (485959).
2051556041 is an equidigital number, since it uses as much as digits as its factorization.
2051556041 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 485958.
The product of its (nonzero) digits is 6000, while the sum is 29.
The square root of 2051556041 is about 45294.1060293721. The cubic root of 2051556041 is about 1270.6554248067.
The spelling of 2051556041 in words is "two billion, fifty-one million, five hundred fifty-six thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •