Base | Representation |
---|---|
bin | 110001101011… |
… | …101100001011 |
3 | 220111200120210 |
4 | 301223230023 |
5 | 11313232021 |
6 | 1143052203 |
7 | 215462610 |
oct | 61535413 |
9 | 26450523 |
10 | 13024011 |
11 | 7396150 |
12 | 4441063 |
13 | 2910120 |
14 | 1a30507 |
15 | 1223e76 |
hex | c6bb0b |
13024011 has 32 divisors (see below), whose sum is σ = 23321088. Its totient is φ = 6243840.
The previous prime is 13024009. The next prime is 13024013. The reversal of 13024011 is 11042031.
It is a happy number.
13024011 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 (13024009) and next prime (13024013).
It is not a de Polignac number, because 13024011 - 21 = 13024009 is a prime.
It is not an unprimeable number, because it can be changed into a prime (13024013) 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, 835 + ... + 5171.
It is an arithmetic number, because the mean of its divisors is an integer number (728784).
Almost surely, 213024011 is an apocalyptic number.
13024011 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
13024011 is a deficient number, since it is larger than the sum of its proper divisors (10297077).
13024011 is a wasteful number, since it uses less digits than its factorization.
13024011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4371.
The product of its (nonzero) digits is 24, while the sum is 12.
The square root of 13024011 is about 3608.8794659839. The cubic root of 13024011 is about 235.2781435761.
Adding to 13024011 its reverse (11042031), we get a palindrome (24066042).
The spelling of 13024011 in words is "thirteen million, twenty-four thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.131 sec. • engine limits •