Base | Representation |
---|---|
bin | 110000111100010… |
… | …1101011100000011 |
3 | 11020110012020220011 |
4 | 1201320231130003 |
5 | 11330404144011 |
6 | 430543125351 |
7 | 55460642515 |
oct | 14170553403 |
9 | 4213166804 |
10 | 1642256131 |
11 | 77301337a |
12 | 399ba3857 |
13 | 20230c4b9 |
14 | 118173bb5 |
15 | 99299621 |
hex | 61e2d703 |
1642256131 has 2 divisors, whose sum is σ = 1642256132. Its totient is φ = 1642256130.
The previous prime is 1642256113. The next prime is 1642256159. The reversal of 1642256131 is 1316522461.
It is a happy number.
Together with previous prime (1642256113) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 1642256131 - 27 = 1642256003 is a prime.
It is a super-2 number, since 2×16422561312 = 5394010399614178322, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1642256093 and 1642256102.
It is not a weakly prime, because it can be changed into another prime (1642256101) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 821128065 + 821128066.
It is an arithmetic number, because the mean of its divisors is an integer number (821128066).
Almost surely, 21642256131 is an apocalyptic number.
1642256131 is a deficient number, since it is larger than the sum of its proper divisors (1).
1642256131 is an equidigital number, since it uses as much as digits as its factorization.
1642256131 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 8640, while the sum is 31.
The square root of 1642256131 is about 40524.7594810876. The cubic root of 1642256131 is about 1179.8142317441.
Adding to 1642256131 its reverse (1316522461), we get a palindrome (2958778592).
The spelling of 1642256131 in words is "one billion, six hundred forty-two million, two hundred fifty-six thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •