Base | Representation |
---|---|
bin | 100100110000110101000111… |
… | …011101101000101101111010 |
3 | 210012110221212120100220102001 |
4 | 210300311013131220231322 |
5 | 132143022334124343320 |
6 | 1331513101455131214 |
7 | 46025242020616501 |
oct | 4460650735505572 |
9 | 705427776326361 |
10 | 161685242809210 |
11 | 47577365492a1a |
12 | 16173824813b0a |
13 | 6c2ab11ca6533 |
14 | 2bcd870dd9838 |
15 | 13a5c0e34020a |
hex | 930d47768b7a |
161685242809210 has 16 divisors (see below), whose sum is σ = 293914956237192. Its totient is φ = 64033759528000.
The previous prime is 161685242809187. The next prime is 161685242809219. The reversal of 161685242809210 is 12908242586161.
161685242809210 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 4 ways, for example, as 135248503270321 + 26436739538889 = 11629639^2 + 5141667^2 .
It is a super-2 number, since 2×1616852428092102 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (161685242809219) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 80042198401 + ... + 80042200420.
Almost surely, 2161685242809210 is an apocalyptic number.
161685242809210 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
161685242809210 is a deficient number, since it is larger than the sum of its proper divisors (132229713427982).
161685242809210 is a wasteful number, since it uses less digits than its factorization.
161685242809210 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 160084398929.
The product of its (nonzero) digits is 3317760, while the sum is 55.
The spelling of 161685242809210 in words is "one hundred sixty-one trillion, six hundred eighty-five billion, two hundred forty-two million, eight hundred nine thousand, two hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •