Base | Representation |
---|---|
bin | 10110111101111… |
… | …010110000100101 |
3 | 222212001210200101 |
4 | 112331322300211 |
5 | 1242121031323 |
6 | 102122544101 |
7 | 12356152462 |
oct | 2675726045 |
9 | 885053611 |
10 | 385330213 |
11 | 188566324 |
12 | a9068031 |
13 | 61aa6358 |
14 | 39266669 |
15 | 23c66dad |
hex | 16f7ac25 |
385330213 has 2 divisors, whose sum is σ = 385330214. Its totient is φ = 385330212.
The previous prime is 385330189. The next prime is 385330223. The reversal of 385330213 is 312033583.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 278455969 + 106874244 = 16687^2 + 10338^2 .
It is an emirp because it is prime and its reverse (312033583) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-385330213 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (385330223) 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, 192665106 + 192665107.
It is an arithmetic number, because the mean of its divisors is an integer number (192665107).
Almost surely, 2385330213 is an apocalyptic number.
It is an amenable number.
385330213 is a deficient number, since it is larger than the sum of its proper divisors (1).
385330213 is an equidigital number, since it uses as much as digits as its factorization.
385330213 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6480, while the sum is 28.
The square root of 385330213 is about 19629.8296732295. The cubic root of 385330213 is about 727.6865606417.
Adding to 385330213 its reverse (312033583), we get a palindrome (697363796).
The spelling of 385330213 in words is "three hundred eighty-five million, three hundred thirty thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •