Base | Representation |
---|---|
bin | 110010011010000… |
… | …1010000110001011 |
3 | 11100212122201222122 |
4 | 1210310022012023 |
5 | 11430444110233 |
6 | 435500241455 |
7 | 56625421064 |
oct | 14464120613 |
9 | 4325581878 |
10 | 1691394443 |
11 | 798825752 |
12 | 3b254028b |
13 | 20c55561b |
14 | 1208c556b |
15 | 9d753d98 |
hex | 64d0a18b |
1691394443 has 8 divisors (see below), whose sum is σ = 1737896496. Its totient is φ = 1645142400.
The previous prime is 1691394437. The next prime is 1691394457. The reversal of 1691394443 is 3444931961.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1691394443 - 218 = 1691132299 is a prime.
It is a super-2 number, since 2×16913944432 = 5721630323622560498, 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 = 1691394394 and 1691394403.
It is not an unprimeable number, because it can be changed into a prime (1691394433) 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 7 ways as a sum of consecutive naturals, for example, 48746 + ... + 75887.
It is an arithmetic number, because the mean of its divisors is an integer number (217237062).
Almost surely, 21691394443 is an apocalyptic number.
1691394443 is a deficient number, since it is larger than the sum of its proper divisors (46502053).
1691394443 is a wasteful number, since it uses less digits than its factorization.
1691394443 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 125005.
The product of its digits is 279936, while the sum is 44.
The square root of 1691394443 is about 41126.5661464703. The cubic root of 1691394443 is about 1191.4659435430.
The spelling of 1691394443 in words is "one billion, six hundred ninety-one million, three hundred ninety-four thousand, four hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •