Base | Representation |
---|---|
bin | 100111010110… |
… | …010100000101 |
3 | 201102001112112 |
4 | 213112110011 |
5 | 10120040023 |
6 | 1005030405 |
7 | 153450632 |
oct | 47262405 |
9 | 21361475 |
10 | 10315013 |
11 | 5905905 |
12 | 3555405 |
13 | 21a2077 |
14 | 1527189 |
15 | d8b478 |
hex | 9d6505 |
10315013 has 4 divisors (see below), whose sum is σ = 10344588. Its totient is φ = 10285440.
The previous prime is 10315003. The next prime is 10315027. The reversal of 10315013 is 31051301.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 31051301 = 19 ⋅1634279.
It can be written as a sum of positive squares in 2 ways, for example, as 1747684 + 8567329 = 1322^2 + 2927^2 .
It is a cyclic number.
It is not a de Polignac number, because 10315013 - 28 = 10314757 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 (10315003) 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, 14258 + ... + 14963.
It is an arithmetic number, because the mean of its divisors is an integer number (2586147).
Almost surely, 210315013 is an apocalyptic number.
It is an amenable number.
10315013 is a deficient number, since it is larger than the sum of its proper divisors (29575).
10315013 is an equidigital number, since it uses as much as digits as its factorization.
10315013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 29574.
The product of its (nonzero) digits is 45, while the sum is 14.
The square root of 10315013 is about 3211.6993944017. The cubic root of 10315013 is about 217.6823713726.
Adding to 10315013 its reverse (31051301), we get a palindrome (41366314).
The spelling of 10315013 in words is "ten million, three hundred fifteen thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •