Base | Representation |
---|---|
bin | 100111001010100111… |
… | …101101111011100001 |
3 | 11000112211020101121100 |
4 | 213022213231323201 |
5 | 1142111323140131 |
6 | 31152553345013 |
7 | 3016066036251 |
oct | 471247557341 |
9 | 130484211540 |
10 | 42054115041 |
11 | 169204a7084 |
12 | 8197a08169 |
13 | 3c727c6053 |
14 | 206d311961 |
15 | 1161ed87e6 |
hex | 9ca9edee1 |
42054115041 has 27 divisors (see below), whose sum is σ = 64544299833. Its totient is φ = 26380333440.
The previous prime is 42054115027. The next prime is 42054115087. The reversal of 42054115041 is 14051145024.
The square root of 42054115041 is 205071.
It is a perfect power (a square), and thus also a powerful number.
42054115041 is a `hidden beast` number, since 4 + 205 + 411 + 5 + 0 + 41 = 666.
It can be written as a sum of positive squares in 4 ways, for example, as 2454707025 + 39599408016 = 49545^2 + 198996^2 .
It is a de Polignac number, because none of the positive numbers 2k-42054115041 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 42054114996 and 42054115014.
It is not an unprimeable number, because it can be changed into a prime (42054115841) by changing a digit.
It is a polite number, since it can be written in 26 ways as a sum of consecutive naturals, for example, 10456611 + ... + 10460631.
Almost surely, 242054115041 is an apocalyptic number.
42054115041 is the 205071-st square number.
42054115041 is the 102536-th centered octagonal number.
It is an amenable number.
42054115041 is a deficient number, since it is larger than the sum of its proper divisors (22490184792).
42054115041 is an frugal number, since it uses more digits than its factorization.
42054115041 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8082 (or 4041 counting only the distinct ones).
The product of its (nonzero) digits is 3200, while the sum is 27.
The spelling of 42054115041 in words is "forty-two billion, fifty-four million, one hundred fifteen thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •