Base | Representation |
---|---|
bin | 100101010100010101011010… |
… | …111100010010000100011110 |
3 | 210112010012121011212210110100 |
4 | 211110111122330102010132 |
5 | 133003011211411043032 |
6 | 1341022011330521530 |
7 | 46366435152423516 |
oct | 4524253274220436 |
9 | 715105534783410 |
10 | 164125111034142 |
11 | 4832808349a625 |
12 | 164a86677362a6 |
13 | 7076c15840a7b |
14 | 2c759aa916846 |
15 | 13e940dd6d97c |
hex | 95455af1211e |
164125111034142 has 48 divisors (see below), whose sum is σ = 376524112685760. Its totient is φ = 51489984877056.
The previous prime is 164125111034119. The next prime is 164125111034161. The reversal of 164125111034142 is 241430111521461.
164125111034142 is a `hidden beast` number, since 1 + 6 + 4 + 125 + 1 + 110 + 3 + 414 + 2 = 666.
It is a super-3 number, since 3×1641251110341423 (a number of 44 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 164125111034097 and 164125111034106.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 69183834 + ... + 71516802.
It is an arithmetic number, because the mean of its divisors is an integer number (7844252347620).
Almost surely, 2164125111034142 is an apocalyptic number.
164125111034142 is an abundant number, since it is smaller than the sum of its proper divisors (212399001651618).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
164125111034142 is a wasteful number, since it uses less digits than its factorization.
164125111034142 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2562897 (or 2562894 counting only the distinct ones).
The product of its (nonzero) digits is 23040, while the sum is 36.
The spelling of 164125111034142 in words is "one hundred sixty-four trillion, one hundred twenty-five billion, one hundred eleven million, thirty-four thousand, one hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •