Base | Representation |
---|---|
bin | 110001100110… |
… | …000110011001 |
3 | 220110112011201 |
4 | 301212012121 |
5 | 11312013423 |
6 | 1142354201 |
7 | 215336056 |
oct | 61460631 |
9 | 26415151 |
10 | 13001113 |
11 | 737aa24 |
12 | 442b961 |
13 | 2902888 |
14 | 1a2602d |
15 | 121c2ad |
hex | c66199 |
13001113 has 4 divisors (see below), whose sum is σ = 13214308. Its totient is φ = 12787920.
The previous prime is 13001101. The next prime is 13001119. The reversal of 13001113 is 31110031.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 1630729 + 11370384 = 1277^2 + 3372^2 .
It is a cyclic number.
It is not a de Polignac number, because 13001113 - 29 = 13000601 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 13001113.
It is not an unprimeable number, because it can be changed into a prime (13001119) 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, 106506 + ... + 106627.
It is an arithmetic number, because the mean of its divisors is an integer number (3303577).
Almost surely, 213001113 is an apocalyptic number.
It is an amenable number.
13001113 is a deficient number, since it is larger than the sum of its proper divisors (213195).
13001113 is an equidigital number, since it uses as much as digits as its factorization.
13001113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 213194.
The product of its (nonzero) digits is 9, while the sum is 10.
The square root of 13001113 is about 3605.7056174901. The cubic root of 13001113 is about 235.1401789280.
Adding to 13001113 its reverse (31110031), we get a palindrome (44111144).
The spelling of 13001113 in words is "thirteen million, one thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •