Base | Representation |
---|---|
bin | 101111000000… |
… | …010011011010 |
3 | 212012000121202 |
4 | 233000103122 |
5 | 11123301020 |
6 | 1120034202 |
7 | 206510141 |
oct | 57002332 |
9 | 25160552 |
10 | 12322010 |
11 | 6a56788 |
12 | 4162962 |
13 | 272573c |
14 | 18ca758 |
15 | 1135e75 |
hex | bc04da |
12322010 has 8 divisors (see below), whose sum is σ = 22179636. Its totient is φ = 4928800.
The previous prime is 12322001. The next prime is 12322019. The reversal of 12322010 is 1022321.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (12322001) and next prime (12322019).
It can be written as a sum of positive squares in 2 ways, for example, as 11895601 + 426409 = 3449^2 + 653^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a junction number, because it is equal to n+sod(n) for n = 12321982 and 12322000.
It is not an unprimeable number, because it can be changed into a prime (12322019) 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 in 3 ways as a sum of consecutive naturals, for example, 616091 + ... + 616110.
Almost surely, 212322010 is an apocalyptic number.
12322010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
12322010 is a deficient number, since it is larger than the sum of its proper divisors (9857626).
12322010 is a wasteful number, since it uses less digits than its factorization.
12322010 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1232208.
The product of its (nonzero) digits is 24, while the sum is 11.
The square root of 12322010 is about 3510.2720692277. The cubic root of 12322010 is about 230.9726297038.
Adding to 12322010 its reverse (1022321), we get a palindrome (13344331).
The spelling of 12322010 in words is "twelve million, three hundred twenty-two thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •