Base | Representation |
---|---|
bin | 10011101111011… |
… | …100001010011110 |
3 | 212002012212102022 |
4 | 103233130022132 |
5 | 1134242000410 |
6 | 52510500142 |
7 | 11131116041 |
oct | 2357341236 |
9 | 762185368 |
10 | 331203230 |
11 | 15aa56986 |
12 | 92b04652 |
13 | 53804657 |
14 | 31db6c58 |
15 | 1e124455 |
hex | 13bdc29e |
331203230 has 8 divisors (see below), whose sum is σ = 596165832. Its totient is φ = 132481288.
The previous prime is 331203227. The next prime is 331203233. The reversal of 331203230 is 32302133.
It is an interprime number because it is at equal distance from previous prime (331203227) and next prime (331203233).
It is a sphenic number, since it is the product of 3 distinct primes.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 331203199 and 331203208.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (331203233) 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 3 ways as a sum of consecutive naturals, for example, 16560152 + ... + 16560171.
It is an arithmetic number, because the mean of its divisors is an integer number (74520729).
Almost surely, 2331203230 is an apocalyptic number.
331203230 is a deficient number, since it is larger than the sum of its proper divisors (264962602).
331203230 is a wasteful number, since it uses less digits than its factorization.
331203230 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 33120330.
The product of its (nonzero) digits is 324, while the sum is 17.
The square root of 331203230 is about 18198.9898071294. The cubic root of 331203230 is about 691.8811859562.
Adding to 331203230 its reverse (32302133), we get a palindrome (363505363).
The spelling of 331203230 in words is "three hundred thirty-one million, two hundred three thousand, two hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •