Base | Representation |
---|---|
bin | 10111101111001110111101 |
3 | 102201011001101 |
4 | 113233032331 |
5 | 3043112111 |
6 | 341213101 |
7 | 103615135 |
oct | 27571675 |
9 | 12634041 |
10 | 6222781 |
11 | 35702a4 |
12 | 2101191 |
13 | 139b526 |
14 | b7dac5 |
15 | 82dbc1 |
hex | 5ef3bd |
6222781 has 2 divisors, whose sum is σ = 6222782. Its totient is φ = 6222780.
The previous prime is 6222767. The next prime is 6222817. The reversal of 6222781 is 1872226.
Together with next prime (6222817) 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., 5428900 + 793881 = 2330^2 + 891^2 .
It is a cyclic number.
It is not a de Polignac number, because 6222781 - 219 = 5698493 is a prime.
It is a super-2 number, since 2×62227812 = 77446006747922, which contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (6222761) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 3111390 + 3111391.
It is an arithmetic number, because the mean of its divisors is an integer number (3111391).
Almost surely, 26222781 is an apocalyptic number.
It is an amenable number.
6222781 is a deficient number, since it is larger than the sum of its proper divisors (1).
6222781 is an equidigital number, since it uses as much as digits as its factorization.
6222781 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 2688, while the sum is 28.
The square root of 6222781 is about 2494.5502600669. The cubic root of 6222781 is about 183.9337840660.
It can be divided in two parts, 622 and 2781, that added together give a triangular number (3403 = T82).
The spelling of 6222781 in words is "six million, two hundred twenty-two thousand, seven hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •