Base | Representation |
---|---|
bin | 100110100011… |
… | …010101101101 |
3 | 201000110010111 |
4 | 212203111231 |
5 | 10041344341 |
6 | 1000340021 |
7 | 151621126 |
oct | 46432555 |
9 | 21013114 |
10 | 10106221 |
11 | 5782a54 |
12 | 3474611 |
13 | 212b018 |
14 | 14b104d |
15 | d49681 |
hex | 9a356d |
10106221 has 4 divisors (see below), whose sum is σ = 10132992. Its totient is φ = 10079452.
The previous prime is 10106203. The next prime is 10106227. The reversal of 10106221 is 12260101.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 12260101 = 7 ⋅1751443.
It is a cyclic number.
It is not a de Polignac number, because 10106221 - 25 = 10106189 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10106227) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 12811 + ... + 13576.
It is an arithmetic number, because the mean of its divisors is an integer number (2533248).
Almost surely, 210106221 is an apocalyptic number.
It is an amenable number.
10106221 is a deficient number, since it is larger than the sum of its proper divisors (26771).
10106221 is an equidigital number, since it uses as much as digits as its factorization.
10106221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26770.
The product of its (nonzero) digits is 24, while the sum is 13.
The square root of 10106221 is about 3179.0283106635. The cubic root of 10106221 is about 216.2036046012.
Adding to 10106221 its reverse (12260101), we get a palindrome (22366322).
The spelling of 10106221 in words is "ten million, one hundred six thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •