Base | Representation |
---|---|
bin | 1001011010001000011… |
… | …1000010110110000001 |
3 | 120110012112000212021212 |
4 | 2112202013002312001 |
5 | 10122011141424401 |
6 | 202130423455505 |
7 | 14451300316553 |
oct | 2264207026601 |
9 | 513175025255 |
10 | 161633545601 |
11 | 62603a17150 |
12 | 273aa8b7595 |
13 | 1231b819458 |
14 | 7b7485b4d3 |
15 | 43100b5dbb |
hex | 25a21c2d81 |
161633545601 has 4 divisors (see below), whose sum is σ = 176327504304. Its totient is φ = 146939586900.
The previous prime is 161633545583. The next prime is 161633545627. The reversal of 161633545601 is 106545336161.
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.
It is a cyclic number.
It is not a de Polignac number, because 161633545601 - 26 = 161633545537 is a prime.
It is a super-2 number, since 2×1616335456012 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (161633545691) 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, 7346979335 + ... + 7346979356.
It is an arithmetic number, because the mean of its divisors is an integer number (44081876076).
Almost surely, 2161633545601 is an apocalyptic number.
161633545601 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
161633545601 is a deficient number, since it is larger than the sum of its proper divisors (14693958703).
161633545601 is a wasteful number, since it uses less digits than its factorization.
161633545601 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14693958702.
The product of its (nonzero) digits is 194400, while the sum is 41.
The spelling of 161633545601 in words is "one hundred sixty-one billion, six hundred thirty-three million, five hundred forty-five thousand, six hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •