Base | Representation |
---|---|
bin | 1100000000011011… |
… | …0110101000001101 |
3 | 22022121200111010122 |
4 | 3000012312220031 |
5 | 23100043201333 |
6 | 1251452314325 |
7 | 142604143604 |
oct | 30006665015 |
9 | 8277614118 |
10 | 3223022093 |
11 | 1404348225 |
12 | 75b4729a5 |
13 | 3c496c685 |
14 | 22809ca3b |
15 | 13ce49798 |
hex | c01b6a0d |
3223022093 has 2 divisors, whose sum is σ = 3223022094. Its totient is φ = 3223022092.
The previous prime is 3223022083. The next prime is 3223022113. The reversal of 3223022093 is 3902203223.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 2546918089 + 676104004 = 50467^2 + 26002^2 .
It is a cyclic number.
It is not a de Polignac number, because 3223022093 - 26 = 3223022029 is a prime.
It is a super-2 number, since 2×32230220932 = 20775742823932201298, which contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (3223022083) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1611511046 + 1611511047.
It is an arithmetic number, because the mean of its divisors is an integer number (1611511047).
Almost surely, 23223022093 is an apocalyptic number.
It is an amenable number.
3223022093 is a deficient number, since it is larger than the sum of its proper divisors (1).
3223022093 is an equidigital number, since it uses as much as digits as its factorization.
3223022093 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3888, while the sum is 26.
The square root of 3223022093 is about 56771.6662869780. Note that the first 3 decimals coincide. The cubic root of 3223022093 is about 1477.1380798385.
The spelling of 3223022093 in words is "three billion, two hundred twenty-three million, twenty-two thousand, ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •