Base | Representation |
---|---|
bin | 110010010011111… |
… | …0100101101001101 |
3 | 11100122120110200020 |
4 | 1210213310231031 |
5 | 11424132123401 |
6 | 435303052353 |
7 | 56556063324 |
oct | 14447645515 |
9 | 4318513606 |
10 | 1688161101 |
11 | 796a17470 |
12 | 3b14410b9 |
13 | 20b9929c3 |
14 | 1202c30bb |
15 | 9d315d36 |
hex | 649f4b4d |
1688161101 has 32 divisors (see below), whose sum is σ = 2520806400. Its totient is φ = 996028800.
The previous prime is 1688161093. The next prime is 1688161147. The reversal of 1688161101 is 1011618861.
It is not a de Polignac number, because 1688161101 - 23 = 1688161093 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (33).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1688161151) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 809406 + ... + 811488.
It is an arithmetic number, because the mean of its divisors is an integer number (78775200).
Almost surely, 21688161101 is an apocalyptic number.
1688161101 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
1688161101 is a deficient number, since it is larger than the sum of its proper divisors (832645299).
1688161101 is a wasteful number, since it uses less digits than its factorization.
1688161101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2737.
The product of its (nonzero) digits is 2304, while the sum is 33.
The square root of 1688161101 is about 41087.2376900662. The cubic root of 1688161101 is about 1190.7062401479.
Adding to 1688161101 its reverse (1011618861), we get a palindrome (2699779962).
The spelling of 1688161101 in words is "one billion, six hundred eighty-eight million, one hundred sixty-one thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.129 sec. • engine limits •