Base | Representation |
---|---|
bin | 110000111111000… |
… | …1100100000100001 |
3 | 11020112220022102202 |
4 | 1201332030200201 |
5 | 11331241202423 |
6 | 431034022545 |
7 | 55506112055 |
oct | 14176144041 |
9 | 4215808382 |
10 | 1643694113 |
11 | 773905796 |
12 | 39a577a55 |
13 | 2026c3b89 |
14 | 118429c65 |
15 | 99480728 |
hex | 61f8c821 |
1643694113 has 6 divisors (see below), whose sum is σ = 1740559014. Its totient is φ = 1546848896.
The previous prime is 1643694109. The next prime is 1643694127. The reversal of 1643694113 is 3114963461.
It can be written as a sum of positive squares in 3 ways, for example, as 465351184 + 1178342929 = 21572^2 + 34327^2 .
It is not a de Polignac number, because 1643694113 - 22 = 1643694109 is a prime.
It is a super-2 number, since 2×16436941132 = 5403460674221713538, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1643694133) 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 5 ways as a sum of consecutive naturals, for example, 162245 + ... + 172077.
It is an arithmetic number, because the mean of its divisors is an integer number (290093169).
Almost surely, 21643694113 is an apocalyptic number.
It is an amenable number.
1643694113 is a deficient number, since it is larger than the sum of its proper divisors (96864901).
1643694113 is an frugal number, since it uses more digits than its factorization.
1643694113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19683 (or 9850 counting only the distinct ones).
The product of its digits is 46656, while the sum is 38.
The square root of 1643694113 is about 40542.4976166985. The cubic root of 1643694113 is about 1180.1584851288.
The spelling of 1643694113 in words is "one billion, six hundred forty-three million, six hundred ninety-four thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •