Base | Representation |
---|---|
bin | 1111001000101100011100… |
… | …0001010111110000010011 |
3 | 2011220222000112200111222000 |
4 | 3302023013001113300103 |
5 | 4140130400314031011 |
6 | 55221125415245043 |
7 | 3335230215540531 |
oct | 362130701276023 |
9 | 64828015614860 |
10 | 16642042330131 |
11 | 533693a046949 |
12 | 1a4940a379783 |
13 | 93945137372a |
14 | 41769cac7151 |
15 | 1dcd6eba5356 |
hex | f22c7057c13 |
16642042330131 has 16 divisors (see below), whose sum is σ = 24654951801120. Its totient is φ = 11094661463040.
The previous prime is 16642042330097. The next prime is 16642042330139. The reversal of 16642042330131 is 13103324024661.
16642042330131 is a `hidden beast` number, since 1 + 6 + 642 + 0 + 4 + 2 + 3 + 3 + 0 + 1 + 3 + 1 = 666.
It is not a de Polignac number, because 16642042330131 - 211 = 16642042328083 is a prime.
It is a super-2 number, since 2×166420423301312 (a number of 27 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (16642042330139) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 10974471 + ... + 12398511.
It is an arithmetic number, because the mean of its divisors is an integer number (1540934487570).
Almost surely, 216642042330131 is an apocalyptic number.
16642042330131 is a deficient number, since it is larger than the sum of its proper divisors (8012909470989).
16642042330131 is a wasteful number, since it uses less digits than its factorization.
16642042330131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1856883 (or 1856877 counting only the distinct ones).
The product of its (nonzero) digits is 62208, while the sum is 36.
Adding to 16642042330131 its reverse (13103324024661), we get a palindrome (29745366354792).
The spelling of 16642042330131 in words is "sixteen trillion, six hundred forty-two billion, forty-two million, three hundred thirty thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.094 sec. • engine limits •