Base | Representation |
---|---|
bin | 100100110000010100010101… |
… | …110111110010100100100111 |
3 | 210012100121000222220010102222 |
4 | 210300110111313302210213 |
5 | 132141433301033104101 |
6 | 1331445001442022555 |
7 | 46022554650005504 |
oct | 4460242567624447 |
9 | 705317028803388 |
10 | 161650051066151 |
11 | 4756344668954a |
12 | 16168a43047a5b |
13 | 6c276c412992b |
14 | 2bcbc9325a4ab |
15 | 13a4d4ea3701b |
hex | 930515df2927 |
161650051066151 has 8 divisors (see below), whose sum is σ = 171159781416624. Its totient is φ = 152140421139840.
The previous prime is 161650051066123. The next prime is 161650051066247. The reversal of 161650051066151 is 151660150056161.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-161650051066151 is a prime.
It is a super-2 number, since 2×1616500510661512 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (161650051066121) 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 7 ways as a sum of consecutive naturals, for example, 21779405 + ... + 28242566.
It is an arithmetic number, because the mean of its divisors is an integer number (21394972677078).
Almost surely, 2161650051066151 is an apocalyptic number.
161650051066151 is a deficient number, since it is larger than the sum of its proper divisors (9509730350473).
161650051066151 is a wasteful number, since it uses less digits than its factorization.
161650051066151 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 50212081.
The product of its (nonzero) digits is 162000, while the sum is 44.
The spelling of 161650051066151 in words is "one hundred sixty-one trillion, six hundred fifty billion, fifty-one million, sixty-six thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •