Base | Representation |
---|---|
bin | 10000100111110100101… |
… | …100011100011011100011 |
3 | 11001012101212120210210221 |
4 | 100213310230130123203 |
5 | 122203333013444211 |
6 | 2232430301103511 |
7 | 145345361416363 |
oct | 20476454343343 |
9 | 4035355523727 |
10 | 1142271624931 |
11 | 40048660a508 |
12 | 165468557b97 |
13 | 8393c6794a8 |
14 | 3d4016389a3 |
15 | 1eaa6b01c71 |
hex | 109f4b1c6e3 |
1142271624931 has 2 divisors, whose sum is σ = 1142271624932. Its totient is φ = 1142271624930.
The previous prime is 1142271624889. The next prime is 1142271625013. The reversal of 1142271624931 is 1394261722411.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 1142271624931 - 27 = 1142271624803 is a prime.
It is a super-2 number, since 2×11422716249312 (a number of 25 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (1142277624931) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 571135812465 + 571135812466.
It is an arithmetic number, because the mean of its divisors is an integer number (571135812466).
Almost surely, 21142271624931 is an apocalyptic number.
1142271624931 is a deficient number, since it is larger than the sum of its proper divisors (1).
1142271624931 is an equidigital number, since it uses as much as digits as its factorization.
1142271624931 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 145152, while the sum is 43.
The spelling of 1142271624931 in words is "one trillion, one hundred forty-two billion, two hundred seventy-one million, six hundred twenty-four thousand, nine hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •