Base | Representation |
---|---|
bin | 100100101100101110010010… |
… | …000000101010110000011011 |
3 | 210011110222102101000112220100 |
4 | 210230232102000222300123 |
5 | 132123411344032240201 |
6 | 1331135305410230443 |
7 | 45665661303515652 |
oct | 4454562200526033 |
9 | 704428371015810 |
10 | 161403025665051 |
11 | 474787032464a5 |
12 | 16128ba2885423 |
13 | 6c0a3173ca641 |
14 | 2bbdd3b91c199 |
15 | 139d6e2e45886 |
hex | 92cb9202ac1b |
161403025665051 has 6 divisors (see below), whose sum is σ = 233137703738420. Its totient is φ = 107602017110028.
The previous prime is 161403025665017. The next prime is 161403025665059. The reversal of 161403025665051 is 150566520304161.
161403025665051 is a `hidden beast` number, since 1 + 6 + 1 + 4 + 0 + 30 + 2 + 566 + 5 + 0 + 51 = 666.
It is not a de Polignac number, because 161403025665051 - 29 = 161403025664539 is a prime.
It is a super-2 number, since 2×1614030256650512 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 161403025664988 and 161403025665006.
It is not an unprimeable number, because it can be changed into a prime (161403025665059) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 8966834759161 + ... + 8966834759178.
Almost surely, 2161403025665051 is an apocalyptic number.
161403025665051 is a deficient number, since it is larger than the sum of its proper divisors (71734678073369).
161403025665051 is a wasteful number, since it uses less digits than its factorization.
161403025665051 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 17933669518345 (or 17933669518342 counting only the distinct ones).
The product of its (nonzero) digits is 648000, while the sum is 45.
The spelling of 161403025665051 in words is "one hundred sixty-one trillion, four hundred three billion, twenty-five million, six hundred sixty-five thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.097 sec. • engine limits •