Base | Representation |
---|---|
bin | 1110100101110010010010… |
… | …0000100010011110000011 |
3 | 2002210122000112120211020000 |
4 | 3221130210200202132003 |
5 | 4100314130213011011 |
6 | 54041423221051043 |
7 | 3244006346443404 |
oct | 351344440423603 |
9 | 62718015524200 |
10 | 16042315360131 |
11 | 5125564886885 |
12 | 1971136b56a83 |
13 | 8c4a26160248 |
14 | 3d6648bd59ab |
15 | 1cc46dcba356 |
hex | e9724822783 |
16042315360131 has 40 divisors (see below), whose sum is σ = 24015715536384. Its totient is φ = 10672000985520.
The previous prime is 16042315360079. The next prime is 16042315360133. The reversal of 16042315360131 is 13106351324061.
16042315360131 is a `hidden beast` number, since 1 + 6 + 0 + 4 + 2 + 3 + 15 + 3 + 601 + 31 = 666.
It is not a de Polignac number, because 16042315360131 - 26 = 16042315360067 is a prime.
It is a super-2 number, since 2×160423153601312 (a number of 27 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (16042315360133) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 39 ways as a sum of consecutive naturals, for example, 627056566 + ... + 627082148.
Almost surely, 216042315360131 is an apocalyptic number.
16042315360131 is a deficient number, since it is larger than the sum of its proper divisors (7973400176253).
16042315360131 is a wasteful number, since it uses less digits than its factorization.
16042315360131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 41853 (or 41844 counting only the distinct ones).
The product of its (nonzero) digits is 38880, while the sum is 36.
Adding to 16042315360131 its reverse (13106351324061), we get a palindrome (29148666684192).
The spelling of 16042315360131 in words is "sixteen trillion, forty-two billion, three hundred fifteen million, three hundred sixty thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •