Base | Representation |
---|---|
bin | 1000010001011100010… |
… | …0101000111111111001 |
3 | 111120211122202111221011 |
4 | 2010113010220333321 |
5 | 4312030434410431 |
6 | 145142310313521 |
7 | 13160614452244 |
oct | 2042704507771 |
9 | 446748674834 |
10 | 142121013241 |
11 | 55300674849 |
12 | 236640588a1 |
13 | 1052c12950c |
14 | 6c431c825b |
15 | 3a6c039cb1 |
hex | 2117128ff9 |
142121013241 has 2 divisors, whose sum is σ = 142121013242. Its totient is φ = 142121013240.
The previous prime is 142121013227. The next prime is 142121013253. The reversal of 142121013241 is 142310121241.
142121013241 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 111620137216 + 30500876025 = 334096^2 + 174645^2 .
It is a cyclic number.
It is not a de Polignac number, because 142121013241 - 27 = 142121013113 is a prime.
It is not a weakly prime, because it can be changed into another prime (142121013341) 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, 71060506620 + 71060506621.
It is an arithmetic number, because the mean of its divisors is an integer number (71060506621).
Almost surely, 2142121013241 is an apocalyptic number.
It is an amenable number.
142121013241 is a deficient number, since it is larger than the sum of its proper divisors (1).
142121013241 is an equidigital number, since it uses as much as digits as its factorization.
142121013241 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 384, while the sum is 22.
Adding to 142121013241 its reverse (142310121241), we get a palindrome (284431134482).
The spelling of 142121013241 in words is "one hundred forty-two billion, one hundred twenty-one million, thirteen thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •