Base | Representation |
---|---|
bin | 1000010011110010100… |
… | …0000111000100110101 |
3 | 111122110120022122012222 |
4 | 2010330220013010311 |
5 | 4314323233142334 |
6 | 145325014452125 |
7 | 13212335030042 |
oct | 2047450070465 |
9 | 448416278188 |
10 | 142751068469 |
11 | 555a4290649 |
12 | 237bb064045 |
13 | 105cc819269 |
14 | 6ca2b561c9 |
15 | 3aa74e2d2e |
hex | 213ca07135 |
142751068469 has 2 divisors, whose sum is σ = 142751068470. Its totient is φ = 142751068468.
The previous prime is 142751068429. The next prime is 142751068483. The reversal of 142751068469 is 964860157241.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 129996302500 + 12754765969 = 360550^2 + 112937^2 .
It is a cyclic number.
It is not a de Polignac number, because 142751068469 - 212 = 142751064373 is a prime.
It is a super-2 number, since 2×1427510684692 (a number of 23 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 142751068469.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (142751068429) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 71375534234 + 71375534235.
It is an arithmetic number, because the mean of its divisors is an integer number (71375534235).
Almost surely, 2142751068469 is an apocalyptic number.
It is an amenable number.
142751068469 is a deficient number, since it is larger than the sum of its proper divisors (1).
142751068469 is an equidigital number, since it uses as much as digits as its factorization.
142751068469 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 2903040, while the sum is 53.
The spelling of 142751068469 in words is "one hundred forty-two billion, seven hundred fifty-one million, sixty-eight thousand, four hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •