Base | Representation |
---|---|
bin | 111110110001110… |
… | …1101011010101001 |
3 | 12102210202221200102 |
4 | 1331203231122221 |
5 | 13303231404230 |
6 | 545005515145 |
7 | 103126031336 |
oct | 17543553251 |
9 | 5383687612 |
10 | 2106513065 |
11 | 991087498 |
12 | 4a9572ab5 |
13 | 27755b547 |
14 | 15daa398d |
15 | c4e02045 |
hex | 7d8ed6a9 |
2106513065 has 8 divisors (see below), whose sum is σ = 2552844168. Its totient is φ = 1668524800.
The previous prime is 2106513043. The next prime is 2106513067. The reversal of 2106513065 is 5603156012.
It can be written as a sum of positive squares in 4 ways, for example, as 429774361 + 1676738704 = 20731^2 + 40948^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 2106513065 - 212 = 2106508969 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2106513067) 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, 2085152 + ... + 2086161.
It is an arithmetic number, because the mean of its divisors is an integer number (319105521).
Almost surely, 22106513065 is an apocalyptic number.
It is an amenable number.
2106513065 is a deficient number, since it is larger than the sum of its proper divisors (446331103).
2106513065 is a wasteful number, since it uses less digits than its factorization.
2106513065 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4171419.
The product of its (nonzero) digits is 5400, while the sum is 29.
The square root of 2106513065 is about 45896.7652999642. The cubic root of 2106513065 is about 1281.9016868281.
Adding to 2106513065 its reverse (5603156012), we get a palindrome (7709669077).
The spelling of 2106513065 in words is "two billion, one hundred six million, five hundred thirteen thousand, sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •