Base | Representation |
---|---|
bin | 100111010111… |
… | …000110000111 |
3 | 201102012221010 |
4 | 213113012013 |
5 | 10120140330 |
6 | 1005053303 |
7 | 153463155 |
oct | 47270607 |
9 | 21365833 |
10 | 10318215 |
11 | 5908256 |
12 | 3557233 |
13 | 21a366b |
14 | 15283d5 |
15 | d8c3b0 |
hex | 9d7187 |
10318215 has 32 divisors (see below), whose sum is σ = 17107200. Its totient is φ = 5308160.
The previous prime is 10318213. The next prime is 10318219. The reversal of 10318215 is 51281301.
10318215 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 10318215 - 21 = 10318213 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 10318191 and 10318200.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10318213) 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 31 ways as a sum of consecutive naturals, for example, 78700 + ... + 78830.
It is an arithmetic number, because the mean of its divisors is an integer number (534600).
Almost surely, 210318215 is an apocalyptic number.
10318215 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
10318215 is a deficient number, since it is larger than the sum of its proper divisors (6788985).
10318215 is a wasteful number, since it uses less digits than its factorization.
10318215 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 287.
The product of its (nonzero) digits is 240, while the sum is 21.
The square root of 10318215 is about 3212.1978457125. The cubic root of 10318215 is about 217.7048934590.
Adding to 10318215 its reverse (51281301), we get a palindrome (61599516).
The spelling of 10318215 in words is "ten million, three hundred eighteen thousand, two hundred fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •