Base | Representation |
---|---|
bin | 111101011011100… |
… | …0001110100110001 |
3 | 12022122121010121000 |
4 | 1322313001310301 |
5 | 13210134330440 |
6 | 540311352213 |
7 | 102036204546 |
oct | 17267016461 |
9 | 5278533530 |
10 | 2061245745 |
11 | 968579489 |
12 | 496382669 |
13 | 26b06c350 |
14 | 157a7cbcd |
15 | c0e5e730 |
hex | 7adc1d31 |
2061245745 has 32 divisors (see below), whose sum is σ = 3946320000. Its totient is φ = 1014766272.
The previous prime is 2061245741. The next prime is 2061245749. The reversal of 2061245745 is 5475421602.
It is a happy number.
2061245745 is a `hidden beast` number, since 2 + 0 + 61 + 24 + 574 + 5 = 666.
It is an interprime number because it is at equal distance from previous prime (2061245741) and next prime (2061245749).
It is not a de Polignac number, because 2061245745 - 22 = 2061245741 is a prime.
It is not an unprimeable number, because it can be changed into a prime (2061245741) 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 in 31 ways as a sum of consecutive naturals, for example, 585495 + ... + 589004.
It is an arithmetic number, because the mean of its divisors is an integer number (123322500).
Almost surely, 22061245745 is an apocalyptic number.
It is an amenable number.
2061245745 is a deficient number, since it is larger than the sum of its proper divisors (1885074255).
2061245745 is a wasteful number, since it uses less digits than its factorization.
2061245745 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1174526 (or 1174520 counting only the distinct ones).
The product of its (nonzero) digits is 67200, while the sum is 36.
The square root of 2061245745 is about 45400.9443183729. The cubic root of 2061245745 is about 1272.6527610359.
The spelling of 2061245745 in words is "two billion, sixty-one million, two hundred forty-five thousand, seven hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •