Base | Representation |
---|---|
bin | 1001011001010000111… |
… | …1111101110010110111 |
3 | 120102121022110111002000 |
4 | 2112110033331302313 |
5 | 10121022124100231 |
6 | 202051355350343 |
7 | 14442444614421 |
oct | 2262417756267 |
9 | 512538414060 |
10 | 161401003191 |
11 | 624a472763a |
12 | 27344a523b3 |
13 | 122b25a9bac |
14 | 7b51a07811 |
15 | 42e997e6e6 |
hex | 25943fdcb7 |
161401003191 has 64 divisors (see below), whose sum is σ = 245684275200. Its totient is φ = 104681161728.
The previous prime is 161401003147. The next prime is 161401003201. The reversal of 161401003191 is 191300104161.
161401003191 is a `hidden beast` number, since 1 + 614 + 0 + 10 + 0 + 31 + 9 + 1 = 666.
It is not a de Polignac number, because 161401003191 - 213 = 161400994999 is a prime.
It is a super-2 number, since 2×1614010031912 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (161401003121) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 173735815 + ... + 173736743.
It is an arithmetic number, because the mean of its divisors is an integer number (3838816800).
Almost surely, 2161401003191 is an apocalyptic number.
161401003191 is a deficient number, since it is larger than the sum of its proper divisors (84283272009).
161401003191 is a wasteful number, since it uses less digits than its factorization.
161401003191 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1885 (or 1879 counting only the distinct ones).
The product of its (nonzero) digits is 648, while the sum is 27.
The spelling of 161401003191 in words is "one hundred sixty-one billion, four hundred one million, three thousand, one hundred ninety-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •