Base | Representation |
---|---|
bin | 100100011111110… |
… | …1101111001110001 |
3 | 10011100102022022121 |
4 | 1020333231321301 |
5 | 10002003201031 |
6 | 321304434241 |
7 | 42230314006 |
oct | 11077557161 |
9 | 3140368277 |
10 | 1224662641 |
11 | 579321194 |
12 | 2a2178981 |
13 | 16694ac67 |
14 | b890d8ad |
15 | 727ad011 |
hex | 48fede71 |
1224662641 has 2 divisors, whose sum is σ = 1224662642. Its totient is φ = 1224662640.
The previous prime is 1224662629. The next prime is 1224662693. The reversal of 1224662641 is 1462664221.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1204367616 + 20295025 = 34704^2 + 4505^2 .
It is a cyclic number.
It is not a de Polignac number, because 1224662641 - 29 = 1224662129 is a prime.
It is a super-2 number, since 2×12246626412 = 2999597168522189762, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1224662597 and 1224662606.
It is not a weakly prime, because it can be changed into another prime (1224662441) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 612331320 + 612331321.
It is an arithmetic number, because the mean of its divisors is an integer number (612331321).
Almost surely, 21224662641 is an apocalyptic number.
It is an amenable number.
1224662641 is a deficient number, since it is larger than the sum of its proper divisors (1).
1224662641 is an equidigital number, since it uses as much as digits as its factorization.
1224662641 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 27648, while the sum is 34.
The square root of 1224662641 is about 34995.1802538578. The cubic root of 1224662641 is about 1069.8892484432.
The spelling of 1224662641 in words is "one billion, two hundred twenty-four million, six hundred sixty-two thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •