Base | Representation |
---|---|
bin | 10000110100111001100… |
… | …001101101101111001111 |
3 | 11002112122022210100000011 |
4 | 100310321201231233033 |
5 | 122421111200421111 |
6 | 2243111353014051 |
7 | 146353321144246 |
oct | 20647141555717 |
9 | 4075568710004 |
10 | 1156311342031 |
11 | 40643067579a |
12 | 1681263b4327 |
13 | 850692831c1 |
14 | 3dd740cd95d |
15 | 2012947d021 |
hex | 10d3986dbcf |
1156311342031 has 2 divisors, whose sum is σ = 1156311342032. Its totient is φ = 1156311342030.
The previous prime is 1156311341929. The next prime is 1156311342079. The reversal of 1156311342031 is 1302431136511.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 1156311342031 - 27 = 1156311341903 is a prime.
It is a super-2 number, since 2×11563113420312 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1156311341984 and 1156311342002.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1156311342731) 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 as a sum of consecutive naturals, namely, 578155671015 + 578155671016.
It is an arithmetic number, because the mean of its divisors is an integer number (578155671016).
Almost surely, 21156311342031 is an apocalyptic number.
1156311342031 is a deficient number, since it is larger than the sum of its proper divisors (1).
1156311342031 is an equidigital number, since it uses as much as digits as its factorization.
1156311342031 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6480, while the sum is 31.
Adding to 1156311342031 its reverse (1302431136511), we get a palindrome (2458742478542).
The spelling of 1156311342031 in words is "one trillion, one hundred fifty-six billion, three hundred eleven million, three hundred forty-two thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •