Base | Representation |
---|---|
bin | 100111000001… |
… | …000111110111 |
3 | 201020122110210 |
4 | 213001013313 |
5 | 10104300330 |
6 | 1003120503 |
7 | 152636604 |
oct | 47010767 |
9 | 21218423 |
10 | 10228215 |
11 | 5856678 |
12 | 3513133 |
13 | 21716ca |
14 | 15036ab |
15 | d708b0 |
hex | 9c11f7 |
10228215 has 24 divisors (see below), whose sum is σ = 17120880. Its totient is φ = 5213824.
The previous prime is 10228193. The next prime is 10228217. The reversal of 10228215 is 51282201.
It is a happy number.
10228215 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 10228215 - 26 = 10228151 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 10228191 and 10228200.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10228217) 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 23 ways as a sum of consecutive naturals, for example, 7291 + ... + 8579.
It is an arithmetic number, because the mean of its divisors is an integer number (713370).
Almost surely, 210228215 is an apocalyptic number.
10228215 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
10228215 is a deficient number, since it is larger than the sum of its proper divisors (6892665).
10228215 is a wasteful number, since it uses less digits than its factorization.
10228215 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1343 (or 1320 counting only the distinct ones).
The product of its (nonzero) digits is 320, while the sum is 21.
The square root of 10228215 is about 3198.1580636360. The cubic root of 10228215 is about 217.0700715895.
The spelling of 10228215 in words is "ten million, two hundred twenty-eight thousand, two hundred fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •