Base | Representation |
---|---|
bin | 1010001100010… |
… | …1010000100101 |
3 | 2222102222100212 |
4 | 2203011100211 |
5 | 41421013023 |
6 | 4124145205 |
7 | 1026243344 |
oct | 243052045 |
9 | 88388325 |
10 | 42751013 |
11 | 2214a518 |
12 | 12398205 |
13 | 8b1aa76 |
14 | 596bb5b |
15 | 3b46e78 |
hex | 28c5425 |
42751013 has 2 divisors, whose sum is σ = 42751014. Its totient is φ = 42751012.
The previous prime is 42751003. The next prime is 42751031. The reversal of 42751013 is 31015724.
Together with next prime (42751031) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 35259844 + 7491169 = 5938^2 + 2737^2 .
It is a cyclic number.
It is not a de Polignac number, because 42751013 - 26 = 42750949 is a prime.
It is a super-2 number, since 2×427510132 = 3655298225052338, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 42751013.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (42751003) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 21375506 + 21375507.
It is an arithmetic number, because the mean of its divisors is an integer number (21375507).
Almost surely, 242751013 is an apocalyptic number.
It is an amenable number.
42751013 is a deficient number, since it is larger than the sum of its proper divisors (1).
42751013 is an equidigital number, since it uses as much as digits as its factorization.
42751013 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 840, while the sum is 23.
The square root of 42751013 is about 6538.4258808982. The cubic root of 42751013 is about 349.6622946704.
Adding to 42751013 its reverse (31015724), we get a palindrome (73766737).
The spelling of 42751013 in words is "forty-two million, seven hundred fifty-one thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •