Base | Representation |
---|---|
bin | 101110100100101110… |
… | …1011101000001111101 |
3 | 100120011100002002002220 |
4 | 1131021131131001331 |
5 | 3114313234040121 |
6 | 113540321035553 |
7 | 10140335654025 |
oct | 1351135350175 |
9 | 316140062086 |
10 | 100016705661 |
11 | 39464906334 |
12 | 17473485bb9 |
13 | 957c10b552 |
14 | 4bab36ca85 |
15 | 29059396c6 |
hex | 174975d07d |
100016705661 has 4 divisors (see below), whose sum is σ = 133355607552. Its totient is φ = 66677803772.
The previous prime is 100016705647. The next prime is 100016705699. The reversal of 100016705661 is 166507610001.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 166507610001 = 3 ⋅55502536667.
It is a cyclic number.
It is not a de Polignac number, because 100016705661 - 25 = 100016705629 is a prime.
It is a super-2 number, since 2×1000167056612 (a number of 23 digits) contains 22 as substring.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100016705861) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 16669450941 + ... + 16669450946.
It is an arithmetic number, because the mean of its divisors is an integer number (33338901888).
Almost surely, 2100016705661 is an apocalyptic number.
It is an amenable number.
100016705661 is a deficient number, since it is larger than the sum of its proper divisors (33338901891).
100016705661 is an equidigital number, since it uses as much as digits as its factorization.
100016705661 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 33338901890.
The product of its (nonzero) digits is 7560, while the sum is 33.
The spelling of 100016705661 in words is "one hundred billion, sixteen million, seven hundred five thousand, six hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •