Base | Representation |
---|---|
bin | 1001001110010111110001… |
… | …0000111111110001100001 |
3 | 1022220121120110001012120000 |
4 | 2103211330100333301201 |
5 | 2312133321132204121 |
6 | 33323222410410213 |
7 | 2064525445526526 |
oct | 223457420776141 |
9 | 38817513035500 |
10 | 10142502616161 |
11 | 3260458348783 |
12 | 1179827730969 |
13 | 587584354686 |
14 | 270c84c8d14d |
15 | 128c6a70a526 |
hex | 9397c43fc61 |
10142502616161 has 10 divisors (see below), whose sum is σ = 15151145883522. Its totient is φ = 6761668410720.
The previous prime is 10142502616091. The next prime is 10142502616187. The reversal of 10142502616161 is 16161620524101.
10142502616161 is a `hidden beast` number, since 1 + 0 + 1 + 4 + 25 + 0 + 2 + 616 + 16 + 1 = 666.
It can be written as a sum of positive squares in only one way, i.e., 5671751823936 + 4470750792225 = 2381544^2 + 2114415^2 .
It is not a de Polignac number, because 10142502616161 - 29 = 10142502615649 is a prime.
It is not an unprimeable number, because it can be changed into a prime (10142502616361) 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 9 ways as a sum of consecutive naturals, for example, 62608040760 + ... + 62608040921.
Almost surely, 210142502616161 is an apocalyptic number.
It is an amenable number.
10142502616161 is a deficient number, since it is larger than the sum of its proper divisors (5008643267361).
10142502616161 is an equidigital number, since it uses as much as digits as its factorization.
10142502616161 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 125216081693 (or 125216081684 counting only the distinct ones).
The product of its (nonzero) digits is 17280, while the sum is 36.
The spelling of 10142502616161 in words is "ten trillion, one hundred forty-two billion, five hundred two million, six hundred sixteen thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •