Base | Representation |
---|---|
bin | 1010001100110… |
… | …0101011100011 |
3 | 2222111112001201 |
4 | 2203030223203 |
5 | 41423001121 |
6 | 4124542031 |
7 | 1026431101 |
oct | 243145343 |
9 | 88445051 |
10 | 42781411 |
11 | 22170342 |
12 | 123b1917 |
13 | 8b2b85a |
14 | 5978c71 |
15 | 3b50e91 |
hex | 28ccae3 |
42781411 has 2 divisors, whose sum is σ = 42781412. Its totient is φ = 42781410.
The previous prime is 42781391. The next prime is 42781429. The reversal of 42781411 is 11418724.
42781411 = T5339 + T5340 + T5341.
42781411 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-42781411 is a prime.
It is equal to p2592163 and since 42781411 and 2592163 have the same sum of digits, it is a Honaker prime.
It is a self number, because there is not a number n which added to its sum of digits gives 42781411.
It is not a weakly prime, because it can be changed into another prime (42781451) 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, 21390705 + 21390706.
It is an arithmetic number, because the mean of its divisors is an integer number (21390706).
Almost surely, 242781411 is an apocalyptic number.
42781411 is the 5341-st centered triangular number.
42781411 is a deficient number, since it is larger than the sum of its proper divisors (1).
42781411 is an equidigital number, since it uses as much as digits as its factorization.
42781411 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 1792, while the sum is 28.
The square root of 42781411 is about 6540.7500334442. The cubic root of 42781411 is about 349.7451505330.
The spelling of 42781411 in words is "forty-two million, seven hundred eighty-one thousand, four hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •