Base | Representation |
---|---|
bin | 10011010001000… |
… | …01000011100101 |
3 | 102021002221121112 |
4 | 21220201003211 |
5 | 312333203401 |
6 | 24011554405 |
7 | 4001466653 |
oct | 1150410345 |
9 | 367087545 |
10 | 161616101 |
11 | 83256629 |
12 | 4615ba05 |
13 | 2763823a |
14 | 1766ddd3 |
15 | e2c63bb |
hex | 9a210e5 |
161616101 has 16 divisors (see below), whose sum is σ = 175219200. Its totient is φ = 148608768.
The previous prime is 161616097. The next prime is 161616107. The reversal of 161616101 is 101616161.
It is a cyclic number.
It is not a de Polignac number, because 161616101 - 22 = 161616097 is a prime.
It is a super-2 number, since 2×1616161012 = 52239528204884402, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (23).
It is an alternating number because its digits alternate between odd and even.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (161616107) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 224420 + ... + 225138.
It is an arithmetic number, because the mean of its divisors is an integer number (10951200).
Almost surely, 2161616101 is an apocalyptic number.
It is an amenable number.
161616101 is a deficient number, since it is larger than the sum of its proper divisors (13603099).
161616101 is a wasteful number, since it uses less digits than its factorization.
161616101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1108.
The product of its (nonzero) digits is 216, while the sum is 23.
The square root of 161616101 is about 12712.8321392206. The cubic root of 161616101 is about 544.7052256626.
The spelling of 161616101 in words is "one hundred sixty-one million, six hundred sixteen thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •