Base | Representation |
---|---|
bin | 111100111011011… |
… | …100000100100001 |
3 | 2122020110212120211 |
4 | 330323130010201 |
5 | 4043141330213 |
6 | 245233334121 |
7 | 34221452002 |
oct | 7473340441 |
9 | 2566425524 |
10 | 1022214433 |
11 | 485016919 |
12 | 246407341 |
13 | 133a17516 |
14 | 99a911a9 |
15 | 5eb1d53d |
hex | 3cedc121 |
1022214433 has 2 divisors, whose sum is σ = 1022214434. Its totient is φ = 1022214432.
The previous prime is 1022214409. The next prime is 1022214443. The reversal of 1022214433 is 3344122201.
1022214433 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., 707932449 + 314281984 = 26607^2 + 17728^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1022214433 is a prime.
It is a super-2 number, since 2×10222144332 = 2089844694067022978, which contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (1022214443) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 511107216 + 511107217.
It is an arithmetic number, because the mean of its divisors is an integer number (511107217).
Almost surely, 21022214433 is an apocalyptic number.
It is an amenable number.
1022214433 is a deficient number, since it is larger than the sum of its proper divisors (1).
1022214433 is an equidigital number, since it uses as much as digits as its factorization.
1022214433 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1152, while the sum is 22.
The square root of 1022214433 is about 31972.0883428030. The cubic root of 1022214433 is about 1007.3506466044.
Adding to 1022214433 its reverse (3344122201), we get a palindrome (4366336634).
The spelling of 1022214433 in words is "one billion, twenty-two million, two hundred fourteen thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •