Base | Representation |
---|---|
bin | 100111001111110110… |
… | …111110110000110101 |
3 | 11000202221121112011101 |
4 | 213033312332300311 |
5 | 1142301323032404 |
6 | 31205413210101 |
7 | 3021214052155 |
oct | 471766766065 |
9 | 130687545141 |
10 | 42142002229 |
11 | 16966075018 |
12 | 8201330931 |
13 | 3c87a883c2 |
14 | 207ac6c765 |
15 | 1169a992a4 |
hex | 9cfdbec35 |
42142002229 has 2 divisors, whose sum is σ = 42142002230. Its totient is φ = 42142002228.
The previous prime is 42142002179. The next prime is 42142002257. The reversal of 42142002229 is 92220024124.
It is an a-pointer prime, because the next prime (42142002257) can be obtained adding 42142002229 to its sum of digits (28).
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 37508068900 + 4633933329 = 193670^2 + 68073^2 .
It is a cyclic number.
It is not a de Polignac number, because 42142002229 - 211 = 42142000181 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 42142002197 and 42142002206.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (42142002269) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 21071001114 + 21071001115.
It is an arithmetic number, because the mean of its divisors is an integer number (21071001115).
Almost surely, 242142002229 is an apocalyptic number.
It is an amenable number.
42142002229 is a deficient number, since it is larger than the sum of its proper divisors (1).
42142002229 is an equidigital number, since it uses as much as digits as its factorization.
42142002229 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4608, while the sum is 28.
The spelling of 42142002229 in words is "forty-two billion, one hundred forty-two million, two thousand, two hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •