Base | Representation |
---|---|
bin | 100110010001111… |
… | …001100101101001 |
3 | 1122202110111012001 |
4 | 212101321211221 |
5 | 2303402222122 |
6 | 143421051001 |
7 | 21625556401 |
oct | 4621714551 |
9 | 1582414161 |
10 | 642226537 |
11 | 2aa57a337 |
12 | 15b0b6a61 |
13 | a3091a04 |
14 | 61419801 |
15 | 3b5ae527 |
hex | 26479969 |
642226537 has 2 divisors, whose sum is σ = 642226538. Its totient is φ = 642226536.
The previous prime is 642226513. The next prime is 642226589. The reversal of 642226537 is 735622246.
642226537 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., 437479056 + 204747481 = 20916^2 + 14309^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-642226537 is a prime.
It is a super-3 number, since 3×6422265373 (a number of 27 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 642226496 and 642226505.
It is not a weakly prime, because it can be changed into another prime (642226237) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 321113268 + 321113269.
It is an arithmetic number, because the mean of its divisors is an integer number (321113269).
Almost surely, 2642226537 is an apocalyptic number.
It is an amenable number.
642226537 is a deficient number, since it is larger than the sum of its proper divisors (1).
642226537 is an equidigital number, since it uses as much as digits as its factorization.
642226537 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 120960, while the sum is 37.
The square root of 642226537 is about 25342.1888754701. The cubic root of 642226537 is about 862.7720794497.
The spelling of 642226537 in words is "six hundred forty-two million, two hundred twenty-six thousand, five hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •