Base | Representation |
---|---|
bin | 10000011110100011100… |
… | …010011110100010010111 |
3 | 11000020201100002010120111 |
4 | 100132203202132202113 |
5 | 122022442422414111 |
6 | 2224103005543451 |
7 | 144543643145326 |
oct | 20364342364227 |
9 | 4006640063514 |
10 | 1132320123031 |
11 | 3a723a20a879 |
12 | 16354b874b87 |
13 | 82a14a3c926 |
14 | 3cb39adc0bd |
15 | 1e6c3123a21 |
hex | 107a389e897 |
1132320123031 has 32 divisors (see below), whose sum is σ = 1280771965440. Its totient is φ = 995835544704.
The previous prime is 1132320123029. The next prime is 1132320123049. The reversal of 1132320123031 is 1303210232311.
It is a cyclic number.
It is not a de Polignac number, because 1132320123031 - 21 = 1132320123029 is a prime.
It is a super-2 number, since 2×11323201230312 (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 = 1132320122993 and 1132320123011.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1132320123731) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 2758281 + ... + 3142093.
It is an arithmetic number, because the mean of its divisors is an integer number (40024123920).
Almost surely, 21132320123031 is an apocalyptic number.
1132320123031 is a deficient number, since it is larger than the sum of its proper divisors (148451842409).
1132320123031 is a wasteful number, since it uses less digits than its factorization.
1132320123031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 384055.
The product of its (nonzero) digits is 648, while the sum is 22.
Adding to 1132320123031 its reverse (1303210232311), we get a palindrome (2435530355342).
The spelling of 1132320123031 in words is "one trillion, one hundred thirty-two billion, three hundred twenty million, one hundred twenty-three thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •