Base | Representation |
---|---|
bin | 11110010100111110010… |
… | …01000101010101100011 |
3 | 10200121201101202121100000 |
4 | 33022133021011111203 |
5 | 114033110310403011 |
6 | 2114413451431043 |
7 | 135200010141540 |
oct | 17123711052543 |
9 | 3617641677300 |
10 | 1042052044131 |
11 | 371a2823807a |
12 | 149b59155483 |
13 | 7735a5180a7 |
14 | 38615379bc7 |
15 | 1c18d491356 |
hex | f29f245563 |
1042052044131 has 96 divisors (see below), whose sum is σ = 1793242447360. Its totient is φ = 592356893184.
The previous prime is 1042052044079. The next prime is 1042052044133. The reversal of 1042052044131 is 1314402502401.
1042052044131 is a `hidden beast` number, since 1 + 0 + 4 + 2 + 0 + 520 + 4 + 4 + 131 = 666.
It is not a de Polignac number, because 1042052044131 - 226 = 1041984935267 is a prime.
It is a super-2 number, since 2×10420520441312 (a number of 25 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a junction number, because it is equal to n+sod(n) for n = 1042052044095 and 1042052044104.
It is not an unprimeable number, because it can be changed into a prime (1042052044133) by changing a digit.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 279144141 + ... + 279147873.
Almost surely, 21042052044131 is an apocalyptic number.
1042052044131 is a deficient number, since it is larger than the sum of its proper divisors (751190403229).
1042052044131 is an equidigital number, since it uses as much as digits as its factorization.
1042052044131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4567 (or 4555 counting only the distinct ones).
The product of its (nonzero) digits is 3840, while the sum is 27.
Adding to 1042052044131 its reverse (1314402502401), we get a palindrome (2356454546532).
The spelling of 1042052044131 in words is "one trillion, forty-two billion, fifty-two million, forty-four thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •