Base | Representation |
---|---|
bin | 111000110011111… |
… | …100101101110011 |
3 | 2110102111122012102 |
4 | 320303330231303 |
5 | 3423001022011 |
6 | 234325051015 |
7 | 32422401014 |
oct | 7063745563 |
9 | 2412448172 |
10 | 953142131 |
11 | 44a029877 |
12 | 227256a6b |
13 | 122612036 |
14 | 9083100b |
15 | 58a2773b |
hex | 38cfcb73 |
953142131 has 2 divisors, whose sum is σ = 953142132. Its totient is φ = 953142130.
The previous prime is 953142097. The next prime is 953142137. The reversal of 953142131 is 131241359.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-953142131 is a prime.
It is a super-2 number, since 2×9531421312 = 1816959843774442322, which contains 22 as substring.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 953142094 and 953142103.
It is not a weakly prime, because it can be changed into another prime (953142137) 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 as a sum of consecutive naturals, namely, 476571065 + 476571066.
It is an arithmetic number, because the mean of its divisors is an integer number (476571066).
Almost surely, 2953142131 is an apocalyptic number.
953142131 is a deficient number, since it is larger than the sum of its proper divisors (1).
953142131 is an equidigital number, since it uses as much as digits as its factorization.
953142131 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 3240, while the sum is 29.
The square root of 953142131 is about 30873.0000323908. Note that the first 4 decimals coincide. The cubic root of 953142131 is about 984.1301917956.
The spelling of 953142131 in words is "nine hundred fifty-three million, one hundred forty-two thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •