Base | Representation |
---|---|
bin | 11101001110100010000… |
… | …00101111000111111011 |
3 | 10120000002210110110212010 |
4 | 32213101000233013323 |
5 | 112423132401324011 |
6 | 2045201100021003 |
7 | 132360566152551 |
oct | 16472100570773 |
9 | 3500083413763 |
10 | 1004234011131 |
11 | 357990a1214a |
12 | 142763b31763 |
13 | 73911522180 |
14 | 368688b3bd1 |
15 | 1b1c83131a6 |
hex | e9d102f1fb |
1004234011131 has 8 divisors (see below), whose sum is σ = 1441977041680. Its totient is φ = 617990160672.
The previous prime is 1004234011129. The next prime is 1004234011139. The reversal of 1004234011131 is 1311104324001.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1004234011131 - 21 = 1004234011129 is a prime.
It is a super-2 number, since 2×10042340111312 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1004234011098 and 1004234011107.
It is not an unprimeable number, because it can be changed into a prime (1004234011139) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 12874794976 + ... + 12874795053.
It is an arithmetic number, because the mean of its divisors is an integer number (180247130210).
Almost surely, 21004234011131 is an apocalyptic number.
1004234011131 is a deficient number, since it is larger than the sum of its proper divisors (437743030549).
1004234011131 is a wasteful number, since it uses less digits than its factorization.
1004234011131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 25749590045.
The product of its (nonzero) digits is 288, while the sum is 21.
Adding to 1004234011131 its reverse (1311104324001), we get a palindrome (2315338335132).
The spelling of 1004234011131 in words is "one trillion, four billion, two hundred thirty-four million, eleven thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •