Base | Representation |
---|---|
bin | 1001011000001111001… |
… | …1001010001000000101 |
3 | 120101220002010212220202 |
4 | 2112003303022020011 |
5 | 10114441001003234 |
6 | 202004140140245 |
7 | 14432554016303 |
oct | 2260363121005 |
9 | 511802125822 |
10 | 161125016069 |
11 | 62372964406 |
12 | 27288537685 |
13 | 1226a368bc4 |
14 | 7b270c5273 |
15 | 42d061577e |
hex | 2583cca205 |
161125016069 has 4 divisors (see below), whose sum is σ = 161126480544. Its totient is φ = 161123551596.
The previous prime is 161125016051. The next prime is 161125016119. The reversal of 161125016069 is 960610521161.
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, and also an emirpimes, since its reverse is a distinct semiprime: 960610521161 = 283 ⋅3394383467.
It is a cyclic number.
It is not a de Polignac number, because 161125016069 - 228 = 160856580613 is a prime.
It is a super-2 number, since 2×1611250160692 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (161125016009) 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, 552497 + ... + 792150.
It is an arithmetic number, because the mean of its divisors is an integer number (40281620136).
Almost surely, 2161125016069 is an apocalyptic number.
It is an amenable number.
161125016069 is a deficient number, since it is larger than the sum of its proper divisors (1464475).
161125016069 is a wasteful number, since it uses less digits than its factorization.
161125016069 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1464474.
The product of its (nonzero) digits is 19440, while the sum is 38.
The spelling of 161125016069 in words is "one hundred sixty-one billion, one hundred twenty-five million, sixteen thousand, sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •