Base | Representation |
---|---|
bin | 11001010110101110101… |
… | …010011101001011101001 |
3 | 20011120102022011122112000 |
4 | 121112232222131023221 |
5 | 212021404340320131 |
6 | 3412235514041213 |
7 | 236612046440166 |
oct | 31265652351351 |
9 | 6146368148460 |
10 | 1742392120041 |
11 | 611a42a22841 |
12 | 24182b719209 |
13 | c83cb275081 |
14 | 604918c706d |
15 | 304cc321ce6 |
hex | 195aea9d2e9 |
1742392120041 has 8 divisors (see below), whose sum is σ = 2581321659360. Its totient is φ = 1161594746676.
The previous prime is 1742392119997. The next prime is 1742392120061. The reversal of 1742392120041 is 1400212932471.
1742392120041 is a `hidden beast` number, since 1 + 7 + 423 + 9 + 21 + 200 + 4 + 1 = 666.
It is not a de Polignac number, because 1742392120041 - 27 = 1742392119913 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1742392119978 and 1742392120005.
It is not an unprimeable number, because it can be changed into a prime (1742392120061) 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 7 ways as a sum of consecutive naturals, for example, 32266520715 + ... + 32266520768.
It is an arithmetic number, because the mean of its divisors is an integer number (322665207420).
Almost surely, 21742392120041 is an apocalyptic number.
It is an amenable number.
1742392120041 is a deficient number, since it is larger than the sum of its proper divisors (838929539319).
1742392120041 is an equidigital number, since it uses as much as digits as its factorization.
1742392120041 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 64533041492 (or 64533041486 counting only the distinct ones).
The product of its (nonzero) digits is 24192, while the sum is 36.
The spelling of 1742392120041 in words is "one trillion, seven hundred forty-two billion, three hundred ninety-two million, one hundred twenty thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •