Base | Representation |
---|---|
bin | 1001011001010010000… |
… | …1110010101001101100 |
3 | 120102121122020220011012 |
4 | 2112110201302221230 |
5 | 10121024323114030 |
6 | 202052043444352 |
7 | 14442532416242 |
oct | 2262441625154 |
9 | 512548226135 |
10 | 161405676140 |
11 | 624a7329485 |
12 | 273465266b8 |
13 | 122b3554b57 |
14 | 7b524a2792 |
15 | 42ea0a4095 |
hex | 2594872a6c |
161405676140 has 12 divisors (see below), whose sum is σ = 338951919936. Its totient is φ = 64562270448.
The previous prime is 161405676137. The next prime is 161405676143. The reversal of 161405676140 is 41676504161.
It is an interprime number because it is at equal distance from previous prime (161405676137) and next prime (161405676143).
It is not an unprimeable number, because it can be changed into a prime (161405676143) 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, 4035141884 + ... + 4035141923.
It is an arithmetic number, because the mean of its divisors is an integer number (28245993328).
Almost surely, 2161405676140 is an apocalyptic number.
161405676140 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
161405676140 is an abundant number, since it is smaller than the sum of its proper divisors (177546243796).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
161405676140 is a wasteful number, since it uses less digits than its factorization.
161405676140 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8070283816 (or 8070283814 counting only the distinct ones).
The product of its (nonzero) digits is 120960, while the sum is 41.
The spelling of 161405676140 in words is "one hundred sixty-one billion, four hundred five million, six hundred seventy-six thousand, one hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •