Base | Representation |
---|---|
bin | 1010000100111… |
… | …0101010111001 |
3 | 2221112022001111 |
4 | 2201032222321 |
5 | 41304442043 |
6 | 4105520321 |
7 | 1022151241 |
oct | 241165271 |
9 | 87468044 |
10 | 42265273 |
11 | 21948586 |
12 | 121a30a1 |
13 | 89aa94b |
14 | 5882b21 |
15 | 3a9d09d |
hex | 284eab9 |
42265273 has 2 divisors, whose sum is σ = 42265274. Its totient is φ = 42265272.
The previous prime is 42265271. The next prime is 42265309. The reversal of 42265273 is 37256224.
42265273 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 39601849 + 2663424 = 6293^2 + 1632^2 .
It is a cyclic number.
It is not a de Polignac number, because 42265273 - 21 = 42265271 is a prime.
Together with 42265271, it forms a pair of twin primes.
It is equal to p2562772 and since 42265273 and 2562772 have the same sum of digits, it is a Honaker prime.
It is not a weakly prime, because it can be changed into another prime (42265271) 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, 21132636 + 21132637.
It is an arithmetic number, because the mean of its divisors is an integer number (21132637).
Almost surely, 242265273 is an apocalyptic number.
It is an amenable number.
42265273 is a deficient number, since it is larger than the sum of its proper divisors (1).
42265273 is an equidigital number, since it uses as much as digits as its factorization.
42265273 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 20160, while the sum is 31.
The square root of 42265273 is about 6501.1747399989. The cubic root of 42265273 is about 348.3329513718.
The spelling of 42265273 in words is "forty-two million, two hundred sixty-five thousand, two hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •