Base | Representation |
---|---|
bin | 11101110100011… |
… | …10110101010011 |
3 | 122102200201222112 |
4 | 32322032311103 |
5 | 1003014134011 |
6 | 40453255535 |
7 | 6125131004 |
oct | 1672166523 |
9 | 572621875 |
10 | 250146131 |
11 | 119223544 |
12 | 6b9345ab |
13 | 3ca94081 |
14 | 253171ab |
15 | 16e6258b |
hex | ee8ed53 |
250146131 has 2 divisors, whose sum is σ = 250146132. Its totient is φ = 250146130.
The previous prime is 250146119. The next prime is 250146133. The reversal of 250146131 is 131641052.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 250146131 - 218 = 249883987 is a prime.
It is a super-2 number, since 2×2501461312 = 125146173708538322, which contains 22 as substring.
It is a Sophie Germain prime.
Together with 250146133, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 250146097 and 250146106.
It is not a weakly prime, because it can be changed into another prime (250146133) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 125073065 + 125073066.
It is an arithmetic number, because the mean of its divisors is an integer number (125073066).
Almost surely, 2250146131 is an apocalyptic number.
250146131 is a deficient number, since it is larger than the sum of its proper divisors (1).
250146131 is an equidigital number, since it uses as much as digits as its factorization.
250146131 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 720, while the sum is 23.
The square root of 250146131 is about 15816.0086937255. The cubic root of 250146131 is about 630.0832433885.
Adding to 250146131 its reverse (131641052), we get a palindrome (381787183).
The spelling of 250146131 in words is "two hundred fifty million, one hundred forty-six thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •