Base | Representation |
---|---|
bin | 111100111110010… |
… | …1111100001001101 |
3 | 12021120211212021211 |
4 | 1321330233201031 |
5 | 13142231411123 |
6 | 535004054421 |
7 | 101462266441 |
oct | 17174574115 |
9 | 5246755254 |
10 | 2045966413 |
11 | 95a992937 |
12 | 491234411 |
13 | 267b4c81a |
14 | 155a22821 |
15 | be94240d |
hex | 79f2f84d |
2045966413 has 8 divisors (see below), whose sum is σ = 2083146680. Its totient is φ = 2008903680.
The previous prime is 2045966407. The next prime is 2045966441. The reversal of 2045966413 is 3146695402.
It can be written as a sum of positive squares in 4 ways, for example, as 927933444 + 1118032969 = 30462^2 + 33437^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 2045966413 - 213 = 2045958221 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2045966213) 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 in 7 ways as a sum of consecutive naturals, for example, 6133 + ... + 64261.
It is an arithmetic number, because the mean of its divisors is an integer number (260393335).
Almost surely, 22045966413 is an apocalyptic number.
It is an amenable number.
2045966413 is a deficient number, since it is larger than the sum of its proper divisors (37180267).
2045966413 is an equidigital number, since it uses as much as digits as its factorization.
2045966413 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 58767.
The product of its (nonzero) digits is 155520, while the sum is 40.
The square root of 2045966413 is about 45232.3602413140. The cubic root of 2045966413 is about 1269.5003744913.
The spelling of 2045966413 in words is "two billion, forty-five million, nine hundred sixty-six thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •