Base | Representation |
---|---|
bin | 1010000100110011… |
… | …0101010001000011 |
3 | 20222110222121121210 |
4 | 2201030311101003 |
5 | 21014322330213 |
6 | 1124210421203 |
7 | 124006556031 |
oct | 24114652103 |
9 | 6873877553 |
10 | 2704495683 |
11 | 11686876aa |
12 | 635891803 |
13 | 3413cbb06 |
14 | 1b9283551 |
15 | 10c6720c3 |
hex | a1335443 |
2704495683 has 16 divisors (see below), whose sum is σ = 3658017440. Its totient is φ = 1777158144.
The previous prime is 2704495681. The next prime is 2704495697. The reversal of 2704495683 is 3865944072.
It is not a de Polignac number, because 2704495683 - 21 = 2704495681 is a prime.
It is a super-3 number, since 3×27044956833 (a number of 29 digits) contains 333 as substring.
It is a Smith number, since the sum of its digits (48) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2704495681) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 41685 + ... + 84537.
It is an arithmetic number, because the mean of its divisors is an integer number (228626090).
Almost surely, 22704495683 is an apocalyptic number.
2704495683 is a deficient number, since it is larger than the sum of its proper divisors (953521757).
2704495683 is a wasteful number, since it uses less digits than its factorization.
2704495683 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 43158.
The product of its (nonzero) digits is 1451520, while the sum is 48.
The square root of 2704495683 is about 52004.7659642845. The cubic root of 2704495683 is about 1393.2490775281.
The spelling of 2704495683 in words is "two billion, seven hundred four million, four hundred ninety-five thousand, six hundred eighty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •