Base | Representation |
---|---|
bin | 110010101111110… |
… | …101100110110101 |
3 | 2012100001122210121 |
4 | 302233311212311 |
5 | 3220424314031 |
6 | 220252251541 |
7 | 30045535033 |
oct | 6257654665 |
9 | 2170048717 |
10 | 851401141 |
11 | 3a7659308 |
12 | 1b9170bb1 |
13 | 10750bc76 |
14 | 81109553 |
15 | 4eb2c011 |
hex | 32bf59b5 |
851401141 has 2 divisors, whose sum is σ = 851401142. Its totient is φ = 851401140.
The previous prime is 851401129. The next prime is 851401147. The reversal of 851401141 is 141104158.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 836424241 + 14976900 = 28921^2 + 3870^2 .
It is a cyclic number.
It is not a de Polignac number, because 851401141 - 211 = 851399093 is a prime.
It is a super-2 number, since 2×8514011412 = 1449767805792203762, which contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (851401147) 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, 425700570 + 425700571.
It is an arithmetic number, because the mean of its divisors is an integer number (425700571).
Almost surely, 2851401141 is an apocalyptic number.
It is an amenable number.
851401141 is a deficient number, since it is larger than the sum of its proper divisors (1).
851401141 is an equidigital number, since it uses as much as digits as its factorization.
851401141 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 640, while the sum is 25.
The square root of 851401141 is about 29178.7789497779. The cubic root of 851401141 is about 947.7884441461.
Adding to 851401141 its reverse (141104158), we get a palindrome (992505299).
The spelling of 851401141 in words is "eight hundred fifty-one million, four hundred one thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •