Base | Representation |
---|---|
bin | 1010000010110… |
… | …0111011001011 |
3 | 2221021021110011 |
4 | 2200230323023 |
5 | 41241031201 |
6 | 4102532351 |
7 | 1021034251 |
oct | 240547313 |
9 | 87237404 |
10 | 42127051 |
11 | 2186374a |
12 | 121370b7 |
13 | 895ca65 |
14 | 58485d1 |
15 | 3a72151 |
hex | 282cecb |
42127051 has 2 divisors, whose sum is σ = 42127052. Its totient is φ = 42127050.
The previous prime is 42127031. The next prime is 42127061. The reversal of 42127051 is 15072124.
42127051 = T5298 + T5299 + T5300.
It is a happy number.
42127051 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 is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-42127051 is a prime.
It is not a weakly prime, because it can be changed into another prime (42127021) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 21063525 + 21063526.
It is an arithmetic number, because the mean of its divisors is an integer number (21063526).
Almost surely, 242127051 is an apocalyptic number.
42127051 is the 5300-th centered triangular number.
42127051 is a deficient number, since it is larger than the sum of its proper divisors (1).
42127051 is an equidigital number, since it uses as much as digits as its factorization.
42127051 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 560, while the sum is 22.
The square root of 42127051 is about 6490.5354940868. The cubic root of 42127051 is about 347.9528137678.
Adding to 42127051 its reverse (15072124), we get a palindrome (57199175).
It can be divided in two parts, 421 and 27051, that added together give a palindrome (27472).
The spelling of 42127051 in words is "forty-two million, one hundred twenty-seven thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •