Base | Representation |
---|---|
bin | 11110010100111100111… |
… | …00010011100111010101 |
3 | 10200121200120200020211100 |
4 | 33022132130103213111 |
5 | 114033044304244013 |
6 | 2114412352100313 |
7 | 135166505313141 |
oct | 17123634234725 |
9 | 3617616606740 |
10 | 1042040306133 |
11 | 371a21650152 |
12 | 149b55234699 |
13 | 77357c68428 |
14 | 386139a2221 |
15 | 1c18c423473 |
hex | f29e7139d5 |
1042040306133 has 12 divisors (see below), whose sum is σ = 1505211017440. Its totient is φ = 694674297576.
The previous prime is 1042040306101. The next prime is 1042040306137. The reversal of 1042040306133 is 3316030402401.
1042040306133 is a `hidden beast` number, since 1 + 0 + 4 + 2 + 0 + 40 + 3 + 0 + 613 + 3 = 666.
It is not a de Polignac number, because 1042040306133 - 25 = 1042040306101 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1042040306097 and 1042040306106.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1042040306137) 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 11 ways as a sum of consecutive naturals, for example, 1256353 + ... + 1913766.
Almost surely, 21042040306133 is an apocalyptic number.
It is an amenable number.
1042040306133 is a deficient number, since it is larger than the sum of its proper divisors (463170711307).
1042040306133 is a wasteful number, since it uses less digits than its factorization.
1042040306133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3206648 (or 3206645 counting only the distinct ones).
The product of its (nonzero) digits is 5184, while the sum is 27.
Adding to 1042040306133 its reverse (3316030402401), we get a palindrome (4358070708534).
The spelling of 1042040306133 in words is "one trillion, forty-two billion, forty million, three hundred six thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •