Base | Representation |
---|---|
bin | 1000011011100011… |
… | …1001111010101001 |
3 | 12211201100120111211 |
4 | 2012320321322221 |
5 | 14113321023413 |
6 | 1012321153121 |
7 | 110036504623 |
oct | 20670717251 |
9 | 5751316454 |
10 | 2263064233 |
11 | a61493721 |
12 | 531a8b7a1 |
13 | 2a0b12281 |
14 | 1767b5c13 |
15 | d3a2783d |
hex | 86e39ea9 |
2263064233 has 2 divisors, whose sum is σ = 2263064234. Its totient is φ = 2263064232.
The previous prime is 2263064207. The next prime is 2263064267. The reversal of 2263064233 is 3324603622.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 2260717209 + 2347024 = 47547^2 + 1532^2 .
It is a cyclic number.
It is not a de Polignac number, because 2263064233 - 29 = 2263063721 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2263064195 and 2263064204.
It is not a weakly prime, because it can be changed into another prime (2263064203) 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, 1131532116 + 1131532117.
It is an arithmetic number, because the mean of its divisors is an integer number (1131532117).
Almost surely, 22263064233 is an apocalyptic number.
It is an amenable number.
2263064233 is a deficient number, since it is larger than the sum of its proper divisors (1).
2263064233 is an equidigital number, since it uses as much as digits as its factorization.
2263064233 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 31104, while the sum is 31.
The square root of 2263064233 is about 47571.6746919845. The cubic root of 2263064233 is about 1312.9019506988.
Adding to 2263064233 its reverse (3324603622), we get a palindrome (5587667855).
The spelling of 2263064233 in words is "two billion, two hundred sixty-three million, sixty-four thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •