Base | Representation |
---|---|
bin | 101111000111… |
… | …001101111010 |
3 | 212020110110122 |
4 | 233013031322 |
5 | 11130202310 |
6 | 1120413242 |
7 | 206655536 |
oct | 57071572 |
9 | 25213418 |
10 | 12350330 |
11 | 6a75a93 |
12 | 4177222 |
13 | 27355b5 |
14 | 18d6bc6 |
15 | 113e555 |
hex | bc737a |
12350330 has 16 divisors (see below), whose sum is σ = 23538600. Its totient is φ = 4649472.
The previous prime is 12350321. The next prime is 12350339. The reversal of 12350330 is 3305321.
It is an interprime number because it is at equal distance from previous prime (12350321) and next prime (12350339).
It can be written as a sum of positive squares in 4 ways, for example, as 10156969 + 2193361 = 3187^2 + 1481^2 .
It is a super-2 number, since 2×123503302 = 305061302217800, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (17).
It is a junction number, because it is equal to n+sod(n) for n = 12350299 and 12350308.
It is not an unprimeable number, because it can be changed into a prime (12350339) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 36155 + ... + 36494.
Almost surely, 212350330 is an apocalyptic number.
12350330 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
12350330 is a deficient number, since it is larger than the sum of its proper divisors (11188270).
12350330 is a wasteful number, since it uses less digits than its factorization.
12350330 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 72673.
The product of its (nonzero) digits is 270, while the sum is 17.
The square root of 12350330 is about 3514.3036294549. The cubic root of 12350330 is about 231.1494444722.
Adding to 12350330 its reverse (3305321), we get a palindrome (15655651).
The spelling of 12350330 in words is "twelve million, three hundred fifty thousand, three hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •