Base | Representation |
---|---|
bin | 1000010010001111001… |
… | …0101001110001111101 |
3 | 111121101112021202210222 |
4 | 2010203302221301331 |
5 | 4313000101323121 |
6 | 145215412111125 |
7 | 13166115311024 |
oct | 2044362516175 |
9 | 447345252728 |
10 | 142334401661 |
11 | 55400071711 |
12 | 237036054a5 |
13 | 105643c075a |
14 | 6c636938bb |
15 | 3a80b3b0ab |
hex | 2123ca9c7d |
142334401661 has 2 divisors, whose sum is σ = 142334401662. Its totient is φ = 142334401660.
The previous prime is 142334401633. The next prime is 142334401687. The reversal of 142334401661 is 166104433241.
142334401661 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., 125139062500 + 17195339161 = 353750^2 + 131131^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-142334401661 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (142334401621) 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, 71167200830 + 71167200831.
It is an arithmetic number, because the mean of its divisors is an integer number (71167200831).
Almost surely, 2142334401661 is an apocalyptic number.
It is an amenable number.
142334401661 is a deficient number, since it is larger than the sum of its proper divisors (1).
142334401661 is an equidigital number, since it uses as much as digits as its factorization.
142334401661 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 41472, while the sum is 35.
The spelling of 142334401661 in words is "one hundred forty-two billion, three hundred thirty-four million, four hundred one thousand, six hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •