Base | Representation |
---|---|
bin | 10000100000010101100… |
… | …001011000110101000011 |
3 | 11000102122121102220110202 |
4 | 100200111201120311003 |
5 | 122040402001041011 |
6 | 2225020441315415 |
7 | 144642223445000 |
oct | 20402541306503 |
9 | 4012577386422 |
10 | 1134232440131 |
11 | 3a8030708a2a |
12 | 1639a4195b6b |
13 | 82c5ac968cb |
14 | 3cc7ba908a7 |
15 | 1e785e6623b |
hex | 10815858d43 |
1134232440131 has 8 divisors (see below), whose sum is σ = 1322720047200. Its totient is φ = 972199234104.
The previous prime is 1134232440119. The next prime is 1134232440139. The reversal of 1134232440131 is 1310442324311.
It is a de Polignac number, because none of the positive numbers 2k-1134232440131 is a prime.
It is a super-2 number, since 2×11342324401312 (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 = 1134232440094 and 1134232440103.
It is not an unprimeable number, because it can be changed into a prime (1134232440139) 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, 1653399716 + ... + 1653400401.
It is an arithmetic number, because the mean of its divisors is an integer number (165340005900).
Almost surely, 21134232440131 is an apocalyptic number.
1134232440131 is a deficient number, since it is larger than the sum of its proper divisors (188487607069).
1134232440131 is an frugal number, since it uses more digits than its factorization.
1134232440131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3306800138 (or 3306800124 counting only the distinct ones).
The product of its (nonzero) digits is 6912, while the sum is 29.
Adding to 1134232440131 its reverse (1310442324311), we get a palindrome (2444674764442).
The spelling of 1134232440131 in words is "one trillion, one hundred thirty-four billion, two hundred thirty-two million, four hundred forty thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •