Base | Representation |
---|---|
bin | 110001101100… |
… | …010000001011 |
3 | 220111210202010 |
4 | 301230100023 |
5 | 11313320230 |
6 | 1143111003 |
7 | 215502411 |
oct | 61542013 |
9 | 26453663 |
10 | 13026315 |
11 | 7397955 |
12 | 4442463 |
13 | 29111a3 |
14 | 1a312b1 |
15 | 12249b0 |
hex | c6c40b |
13026315 has 32 divisors (see below), whose sum is σ = 21772800. Its totient is φ = 6644480.
The previous prime is 13026311. The next prime is 13026319. The reversal of 13026315 is 51362031.
13026315 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is an interprime number because it is at equal distance from previous prime (13026311) and next prime (13026319).
It is not a de Polignac number, because 13026315 - 22 = 13026311 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 13026291 and 13026300.
It is not an unprimeable number, because it can be changed into a prime (13026311) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 36106 + ... + 36464.
It is an arithmetic number, because the mean of its divisors is an integer number (680400).
Almost surely, 213026315 is an apocalyptic number.
13026315 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
13026315 is a deficient number, since it is larger than the sum of its proper divisors (8746485).
13026315 is a wasteful number, since it uses less digits than its factorization.
13026315 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 467.
The product of its (nonzero) digits is 540, while the sum is 21.
The square root of 13026315 is about 3609.1986645237. The cubic root of 13026315 is about 235.2920166418.
Adding to 13026315 its reverse (51362031), we get a palindrome (64388346).
The spelling of 13026315 in words is "thirteen million, twenty-six thousand, three hundred fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •