Base | Representation |
---|---|
bin | 1000010001111101110… |
… | …1000111011011000001 |
3 | 111121012110101110020102 |
4 | 2010133131013123001 |
5 | 4312322440201131 |
6 | 145204252452145 |
7 | 13164243022313 |
oct | 2043735073301 |
9 | 447173343212 |
10 | 142261647041 |
11 | 55372a9a028 |
12 | 236a317a055 |
13 | 105522c9197 |
14 | 6c57b557b3 |
15 | 3a795691cb |
hex | 211f7476c1 |
142261647041 has 2 divisors, whose sum is σ = 142261647042. Its totient is φ = 142261647040.
The previous prime is 142261646983. The next prime is 142261647053. The reversal of 142261647041 is 140746162241.
142261647041 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., 134154445441 + 8107201600 = 366271^2 + 90040^2 .
It is a cyclic number.
It is not a de Polignac number, because 142261647041 - 218 = 142261384897 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 142261646986 and 142261647004.
It is not a weakly prime, because it can be changed into another prime (142261647091) 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, 71130823520 + 71130823521.
It is an arithmetic number, because the mean of its divisors is an integer number (71130823521).
Almost surely, 2142261647041 is an apocalyptic number.
It is an amenable number.
142261647041 is a deficient number, since it is larger than the sum of its proper divisors (1).
142261647041 is an equidigital number, since it uses as much as digits as its factorization.
142261647041 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 64512, while the sum is 38.
The spelling of 142261647041 in words is "one hundred forty-two billion, two hundred sixty-one million, six hundred forty-seven thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •