Base | Representation |
---|---|
bin | 1001011001111000001… |
… | …1011111010111110101 |
3 | 120110000210000001011002 |
4 | 2112132003133113311 |
5 | 10121341232130023 |
6 | 202115553253045 |
7 | 14446513063523 |
oct | 2263603372765 |
9 | 513023001132 |
10 | 161565505013 |
11 | 62579574260 |
12 | 2738bb64185 |
13 | 1230a6b5753 |
14 | 7b697c9313 |
15 | 4309125b28 |
hex | 259e0df5f5 |
161565505013 has 4 divisors (see below), whose sum is σ = 176253278208. Its totient is φ = 146877731820.
The previous prime is 161565505007. The next prime is 161565505109. The reversal of 161565505013 is 310505565161.
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 161565505013 - 210 = 161565503989 is a prime.
It is a super-2 number, since 2×1615655050132 (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 (161565505513) 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 3 ways as a sum of consecutive naturals, for example, 7343886581 + ... + 7343886602.
It is an arithmetic number, because the mean of its divisors is an integer number (44063319552).
Almost surely, 2161565505013 is an apocalyptic number.
It is an amenable number.
161565505013 is a deficient number, since it is larger than the sum of its proper divisors (14687773195).
161565505013 is a wasteful number, since it uses less digits than its factorization.
161565505013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14687773194.
The product of its (nonzero) digits is 67500, while the sum is 38.
The spelling of 161565505013 in words is "one hundred sixty-one billion, five hundred sixty-five million, five hundred five thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •