Base | Representation |
---|---|
bin | 100110111111… |
… | …001100101011 |
3 | 201020020122210 |
4 | 212333030223 |
5 | 10104022311 |
6 | 1003020203 |
7 | 152604612 |
oct | 46771453 |
9 | 21206583 |
10 | 10220331 |
11 | 5850760 |
12 | 350a663 |
13 | 216ac44 |
14 | 1500879 |
15 | d6d3a6 |
hex | 9bf32b |
10220331 has 8 divisors (see below), whose sum is σ = 14865984. Its totient is φ = 6194120.
The previous prime is 10220323. The next prime is 10220339. The reversal of 10220331 is 13302201.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (10220323) and next prime (10220339).
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 10220331 - 23 = 10220323 is a prime.
It is a super-2 number, since 2×102203312 = 208910331499122, which contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (10220339) 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, 154821 + ... + 154886.
It is an arithmetic number, because the mean of its divisors is an integer number (1858248).
Almost surely, 210220331 is an apocalyptic number.
10220331 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
10220331 is a deficient number, since it is larger than the sum of its proper divisors (4645653).
10220331 is a wasteful number, since it uses less digits than its factorization.
10220331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 309721.
The product of its (nonzero) digits is 36, while the sum is 12.
The square root of 10220331 is about 3196.9252415407. The cubic root of 10220331 is about 217.0142840661.
Adding to 10220331 its reverse (13302201), we get a palindrome (23522532).
The spelling of 10220331 in words is "ten million, two hundred twenty thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •