Base | Representation |
---|---|
bin | 10000011101010110101… |
… | …110011100000110000011 |
3 | 11000010101112010212220220 |
4 | 100131112232130012003 |
5 | 122012323020204443 |
6 | 2223331052234123 |
7 | 144500004246513 |
oct | 20352656340603 |
9 | 4003345125826 |
10 | 1131031413123 |
11 | 3a6738823a67 |
12 | 16325016b943 |
13 | 8286aa587a1 |
14 | 3ca568b9843 |
15 | 1e649e13a83 |
hex | 10756b9c183 |
1131031413123 has 32 divisors (see below), whose sum is σ = 1531434854400. Its totient is φ = 742416192000.
The previous prime is 1131031413121. The next prime is 1131031413131. The reversal of 1131031413123 is 3213141301311.
It is not a de Polignac number, because 1131031413123 - 21 = 1131031413121 is a prime.
It is a super-2 number, since 2×11310314131232 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1131031413093 and 1131031413102.
It is not an unprimeable number, because it can be changed into a prime (1131031413121) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 53953518 + ... + 53974476.
It is an arithmetic number, because the mean of its divisors is an integer number (47857339200).
Almost surely, 21131031413123 is an apocalyptic number.
1131031413123 is a deficient number, since it is larger than the sum of its proper divisors (400403441277).
1131031413123 is a wasteful number, since it uses less digits than its factorization.
1131031413123 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22043.
The product of its (nonzero) digits is 648, while the sum is 24.
Adding to 1131031413123 its reverse (3213141301311), we get a palindrome (4344172714434).
The spelling of 1131031413123 in words is "one trillion, one hundred thirty-one billion, thirty-one million, four hundred thirteen thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •