Base | Representation |
---|---|
bin | 111101100101010… |
… | …1101110101010011 |
3 | 12100000022100010221 |
4 | 1323022231311103 |
5 | 13213000003424 |
6 | 541014133511 |
7 | 102131111305 |
oct | 17312556523 |
9 | 5300270127 |
10 | 2066406739 |
11 | 970483a71 |
12 | 498051297 |
13 | 26c1584a7 |
14 | 158623975 |
15 | c162d9e4 |
hex | 7b2add53 |
2066406739 has 4 divisors (see below), whose sum is σ = 2066793624. Its totient is φ = 2066019856.
The previous prime is 2066406721. The next prime is 2066406751. The reversal of 2066406739 is 9376046602.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 2066406739 - 215 = 2066373971 is a prime.
It is a super-2 number, since 2×20664067392 = 8540073621969228242, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2066406695 and 2066406704.
It is not an unprimeable number, because it can be changed into a prime (2066406799) 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 3 ways as a sum of consecutive naturals, for example, 185317 + ... + 196150.
It is an arithmetic number, because the mean of its divisors is an integer number (516698406).
Almost surely, 22066406739 is an apocalyptic number.
2066406739 is a deficient number, since it is larger than the sum of its proper divisors (386885).
2066406739 is an equidigital number, since it uses as much as digits as its factorization.
2066406739 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 386884.
The product of its (nonzero) digits is 326592, while the sum is 43.
The square root of 2066406739 is about 45457.7467435420. The cubic root of 2066406739 is about 1273.7140414229.
The spelling of 2066406739 in words is "two billion, sixty-six million, four hundred six thousand, seven hundred thirty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •