Base | Representation |
---|---|
bin | 110001110101… |
… | …010111001111 |
3 | 220120200221012 |
4 | 301311113033 |
5 | 11321014011 |
6 | 1143555435 |
7 | 216016250 |
oct | 61652717 |
9 | 26520835 |
10 | 13063631 |
11 | 7412999 |
12 | 445bb7b |
13 | 2925179 |
14 | 1a40b27 |
15 | 1230a8b |
hex | c755cf |
13063631 has 4 divisors (see below), whose sum is σ = 14929872. Its totient is φ = 11197392.
The previous prime is 13063613. The next prime is 13063649. The reversal of 13063631 is 13636031.
It is a semiprime because it is the product of two primes.
It is an interprime number because it is at equal distance from previous prime (13063613) and next prime (13063649).
It is a cyclic number.
It is not a de Polignac number, because 13063631 - 210 = 13062607 is a prime.
It is a super-2 number, since 2×130636312 = 341316909808322, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 13063597 and 13063606.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13063031) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 933110 + ... + 933123.
It is an arithmetic number, because the mean of its divisors is an integer number (3732468).
Almost surely, 213063631 is an apocalyptic number.
13063631 is a deficient number, since it is larger than the sum of its proper divisors (1866241).
13063631 is an equidigital number, since it uses as much as digits as its factorization.
13063631 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1866240.
The product of its (nonzero) digits is 972, while the sum is 23.
The square root of 13063631 is about 3614.3645361253. The cubic root of 13063631 is about 235.5164798699.
Adding to 13063631 its reverse (13636031), we get a palindrome (26699662).
The spelling of 13063631 in words is "thirteen million, sixty-three thousand, six hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •