Base | Representation |
---|---|
bin | 100101000100110… |
… | …101111110010001 |
3 | 1121100110020010202 |
4 | 211010311332101 |
5 | 2233214323031 |
6 | 141420104545 |
7 | 21262065515 |
oct | 4504657621 |
9 | 1540406122 |
10 | 622026641 |
11 | 29a132905 |
12 | 154395155 |
13 | 9bb3b602 |
14 | 5c87c145 |
15 | 3991e2cb |
hex | 25135f91 |
622026641 has 2 divisors, whose sum is σ = 622026642. Its totient is φ = 622026640.
The previous prime is 622026619. The next prime is 622026653. The reversal of 622026641 is 146620226.
622026641 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 can be written as a sum of positive squares in only one way, i.e., 470022400 + 152004241 = 21680^2 + 12329^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-622026641 is a prime.
It is a super-2 number, since 2×6220266412 = 773834284227485762, which contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (622022641) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 311013320 + 311013321.
It is an arithmetic number, because the mean of its divisors is an integer number (311013321).
Almost surely, 2622026641 is an apocalyptic number.
It is an amenable number.
622026641 is a deficient number, since it is larger than the sum of its proper divisors (1).
622026641 is an equidigital number, since it uses as much as digits as its factorization.
622026641 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6912, while the sum is 29.
The square root of 622026641 is about 24940.4619243510. The cubic root of 622026641 is about 853.6299849376.
Adding to 622026641 its reverse (146620226), we get a palindrome (768646867).
The spelling of 622026641 in words is "six hundred twenty-two million, twenty-six thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •