Base | Representation |
---|---|
bin | 1100010100101010011011 |
3 | 20002010020002 |
4 | 30110222123 |
5 | 1311332423 |
6 | 153123215 |
7 | 36312653 |
oct | 14245233 |
9 | 6063202 |
10 | 3230363 |
11 | 1907024 |
12 | 10b950b |
13 | 891476 |
14 | 601363 |
15 | 43c228 |
hex | 314a9b |
3230363 has 2 divisors, whose sum is σ = 3230364. Its totient is φ = 3230362.
The previous prime is 3230347. The next prime is 3230369. The reversal of 3230363 is 3630323.
3230363 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 is an emirp because it is prime and its reverse (3630323) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 3230363 - 24 = 3230347 is a prime.
It is a super-2 number, since 2×32303632 = 20870490223538, which contains 22 as substring.
It is a Chen prime.
It is an alternating number because its digits alternate between odd and even.
It is not a weakly prime, because it can be changed into another prime (3230369) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1615181 + 1615182.
It is an arithmetic number, because the mean of its divisors is an integer number (1615182).
Almost surely, 23230363 is an apocalyptic number.
3230363 is a deficient number, since it is larger than the sum of its proper divisors (1).
3230363 is an equidigital number, since it uses as much as digits as its factorization.
3230363 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 972, while the sum is 20.
The square root of 3230363 is about 1797.3210620254. The cubic root of 3230363 is about 147.8258695912.
Adding to 3230363 its reverse (3630323), we get a palindrome (6860686).
The spelling of 3230363 in words is "three million, two hundred thirty thousand, three hundred sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •