Base | Representation |
---|---|
bin | 100100101111111000110100… |
… | …100000111110000000100111 |
3 | 210012020202202120010001220000 |
4 | 210233320310200332000213 |
5 | 132140442241101000221 |
6 | 1331423233300512343 |
7 | 46020460444360332 |
oct | 4457706440760047 |
9 | 705222676101800 |
10 | 161620500406311 |
11 | 47551962050421 |
12 | 161631766ab6b3 |
13 | 6c24994b900ab |
14 | 2bca68c77b619 |
15 | 13a41c05bae26 |
hex | 92fe3483e027 |
161620500406311 has 40 divisors (see below), whose sum is σ = 248576663688144. Its totient is φ = 104573484691200.
The previous prime is 161620500406271. The next prime is 161620500406373. The reversal of 161620500406311 is 113604005026161.
161620500406311 is a `hidden beast` number, since 1 + 6 + 16 + 2 + 0 + 5 + 0 + 0 + 4 + 0 + 631 + 1 = 666.
It is not a de Polignac number, because 161620500406311 - 218 = 161620500144167 is a prime.
It is a super-2 number, since 2×1616205004063112 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (161620500006311) 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 39 ways as a sum of consecutive naturals, for example, 66039385 + ... + 68442978.
Almost surely, 2161620500406311 is an apocalyptic number.
161620500406311 is a deficient number, since it is larger than the sum of its proper divisors (86956163281833).
161620500406311 is a wasteful number, since it uses less digits than its factorization.
161620500406311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 134482813 (or 134482804 counting only the distinct ones).
The product of its (nonzero) digits is 25920, while the sum is 36.
The spelling of 161620500406311 in words is "one hundred sixty-one trillion, six hundred twenty billion, five hundred million, four hundred six thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •