Base | Representation |
---|---|
bin | 111011110010111… |
… | …0110010100010111 |
3 | 12011211102012210201 |
4 | 1313211312110113 |
5 | 13102120114034 |
6 | 531032201331 |
7 | 100502131231 |
oct | 16745662427 |
9 | 5154365721 |
10 | 2006410519 |
11 | 93a625a13 |
12 | 47bb39247 |
13 | 25c8b0179 |
14 | 150687251 |
15 | bb22c014 |
hex | 77976517 |
2006410519 has 4 divisors (see below), whose sum is σ = 2007021640. Its totient is φ = 2005799400.
The previous prime is 2006410517. The next prime is 2006410529. The reversal of 2006410519 is 9150146002.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 9150146002 = 2 ⋅4575073001.
It is a cyclic number.
It is not a de Polignac number, because 2006410519 - 21 = 2006410517 is a prime.
It is a super-2 number, since 2×20064105192 = 8051366341507698722, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2006410517) 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, 300609 + ... + 307210.
It is an arithmetic number, because the mean of its divisors is an integer number (501755410).
Almost surely, 22006410519 is an apocalyptic number.
2006410519 is a deficient number, since it is larger than the sum of its proper divisors (611121).
2006410519 is an equidigital number, since it uses as much as digits as its factorization.
2006410519 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 611120.
The product of its (nonzero) digits is 2160, while the sum is 28.
The square root of 2006410519 is about 44792.9739914643. The cubic root of 2006410519 is about 1261.2657388623.
The spelling of 2006410519 in words is "two billion, six million, four hundred ten thousand, five hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.031 sec. • engine limits •