Base | Representation |
---|---|
bin | 10110110001011… |
… | …001001111101101 |
3 | 222121220000020210 |
4 | 112301121033231 |
5 | 1240301002323 |
6 | 101524333033 |
7 | 12316230162 |
oct | 2661311755 |
9 | 877800223 |
10 | 382047213 |
11 | 1867237a9 |
12 | a7b44179 |
13 | 611c6c52 |
14 | 38a50069 |
15 | 23819293 |
hex | 16c593ed |
382047213 has 16 divisors (see below), whose sum is σ = 512962560. Its totient is φ = 252922224.
The previous prime is 382047203. The next prime is 382047223. The reversal of 382047213 is 312740283.
It is an interprime number because it is at equal distance from previous prime (382047203) and next prime (382047223).
It is a de Polignac number, because none of the positive numbers 2k-382047213 is a prime.
It is a super-2 number, since 2×3820472132 = 291920145922134738, which contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (382047203) 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 in 15 ways as a sum of consecutive naturals, for example, 345820 + ... + 346922.
It is an arithmetic number, because the mean of its divisors is an integer number (32060160).
Almost surely, 2382047213 is an apocalyptic number.
It is an amenable number.
382047213 is a deficient number, since it is larger than the sum of its proper divisors (130915347).
382047213 is a wasteful number, since it uses less digits than its factorization.
382047213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1808.
The product of its (nonzero) digits is 8064, while the sum is 30.
The square root of 382047213 is about 19546.0280619874. The cubic root of 382047213 is about 725.6140421337.
Adding to 382047213 its reverse (312740283), we get a palindrome (694787496).
The spelling of 382047213 in words is "three hundred eighty-two million, forty-seven thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •