Base | Representation |
---|---|
bin | 1001011010000011101… |
… | …1000011010000010111 |
3 | 120110011010112202110111 |
4 | 2112200323003100113 |
5 | 10121441041434333 |
6 | 202124432503451 |
7 | 14450636066233 |
oct | 2264073032027 |
9 | 513133482414 |
10 | 161613624343 |
11 | 625a374aaa6 |
12 | 273a40aab87 |
13 | 12317662b22 |
14 | 7b71d535c3 |
15 | 430d47d4cd |
hex | 25a0ec3417 |
161613624343 has 4 divisors (see below), whose sum is σ = 161625701160. Its totient is φ = 161601547528.
The previous prime is 161613624307. The next prime is 161613624373. The reversal of 161613624343 is 343426316161.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 161613624343 - 233 = 153023689751 is a prime.
It is a super-2 number, since 2×1616136243432 (a number of 23 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 = 161613624296 and 161613624305.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (161613624373) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 6018313 + ... + 6045106.
It is an arithmetic number, because the mean of its divisors is an integer number (40406425290).
Almost surely, 2161613624343 is an apocalyptic number.
161613624343 is a deficient number, since it is larger than the sum of its proper divisors (12076817).
161613624343 is a wasteful number, since it uses less digits than its factorization.
161613624343 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12076816.
The product of its digits is 186624, while the sum is 40.
The spelling of 161613624343 in words is "one hundred sixty-one billion, six hundred thirteen million, six hundred twenty-four thousand, three hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •