Base | Representation |
---|---|
bin | 1100011000110010… |
… | …1000011101011111 |
3 | 22120201221200011211 |
4 | 3012030220131133 |
5 | 23302222401343 |
6 | 1305542325251 |
7 | 145254510202 |
oct | 30614503537 |
9 | 8521850154 |
10 | 3325200223 |
11 | 1456a97164 |
12 | 789729827 |
13 | 40cb966c7 |
14 | 237899939 |
15 | 146dce79d |
hex | c632875f |
3325200223 has 2 divisors, whose sum is σ = 3325200224. Its totient is φ = 3325200222.
The previous prime is 3325200173. The next prime is 3325200247. The reversal of 3325200223 is 3220025233.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 3325200223 - 221 = 3323103071 is a prime.
It is a super-2 number, since 2×33252002232 = 22113913046078499458, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 3325200194 and 3325200203.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (3325200253) 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, 1662600111 + 1662600112.
It is an arithmetic number, because the mean of its divisors is an integer number (1662600112).
Almost surely, 23325200223 is an apocalyptic number.
3325200223 is a deficient number, since it is larger than the sum of its proper divisors (1).
3325200223 is an equidigital number, since it uses as much as digits as its factorization.
3325200223 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2160, while the sum is 22.
The square root of 3325200223 is about 57664.5491008124. The cubic root of 3325200223 is about 1492.5856674236.
Adding to 3325200223 its reverse (3220025233), we get a palindrome (6545225456).
The spelling of 3325200223 in words is "three billion, three hundred twenty-five million, two hundred thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •