Base | Representation |
---|---|
bin | 110001111111… |
… | …000111010000 |
3 | 220122201201100 |
4 | 301333013100 |
5 | 11323303233 |
6 | 1144504400 |
7 | 216243552 |
oct | 61770720 |
9 | 26581640 |
10 | 13103568 |
11 | 743a9a5 |
12 | 447b100 |
13 | 293a3ba |
14 | 1a514d2 |
15 | 123c813 |
hex | c7f1d0 |
13103568 has 30 divisors (see below), whose sum is σ = 36672194. Its totient is φ = 4367808.
The previous prime is 13103567. The next prime is 13103569. The reversal of 13103568 is 86530131.
It is an interprime number because it is at equal distance from previous prime (13103567) and next prime (13103569).
It can be written as a sum of positive squares in only one way, i.e., 7683984 + 5419584 = 2772^2 + 2328^2 .
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13103567) 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 5 ways as a sum of consecutive naturals, for example, 45355 + ... + 45642.
Almost surely, 213103568 is an apocalyptic number.
13103568 is a gapful number since it is divisible by the number (18) formed by its first and last digit.
It is an amenable number.
13103568 is an abundant number, since it is smaller than the sum of its proper divisors (23568626).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13103568 is a wasteful number, since it uses less digits than its factorization.
13103568 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 91011 (or 91002 counting only the distinct ones).
The product of its (nonzero) digits is 2160, while the sum is 27.
The square root of 13103568 is about 3619.8850810488. The cubic root of 13103568 is about 235.7562359024.
Adding to 13103568 its reverse (86530131), we get a palindrome (99633699).
The spelling of 13103568 in words is "thirteen million, one hundred three thousand, five hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •