Base | Representation |
---|---|
bin | 11001010101111111… |
… | …11011110011110101 |
3 | 1022010020122220120201 |
4 | 30222333323303311 |
5 | 210331203230023 |
6 | 10130050200501 |
7 | 661114453510 |
oct | 145277736365 |
9 | 38106586521 |
10 | 13606305013 |
11 | 585244a384 |
12 | 2778883131 |
13 | 138ab97372 |
14 | 9310b3d77 |
15 | 5497b7bad |
hex | 32affbcf5 |
13606305013 has 8 divisors (see below), whose sum is σ = 15575685632. Its totient is φ = 11643330096.
The previous prime is 13606305007. The next prime is 13606305019. The reversal of 13606305013 is 31050360631.
It is an interprime number because it is at equal distance from previous prime (13606305007) and next prime (13606305019).
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 13606305013 - 25 = 13606304981 is a prime.
It is a super-2 number, since 2×136063050132 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13606305019) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1596870 + ... + 1605367.
It is an arithmetic number, because the mean of its divisors is an integer number (1946960704).
Almost surely, 213606305013 is an apocalyptic number.
It is an amenable number.
13606305013 is a deficient number, since it is larger than the sum of its proper divisors (1969380619).
13606305013 is an equidigital number, since it uses as much as digits as its factorization.
13606305013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3202851.
The product of its (nonzero) digits is 4860, while the sum is 28.
Adding to 13606305013 its reverse (31050360631), we get a palindrome (44656665644).
The spelling of 13606305013 in words is "thirteen billion, six hundred six million, three hundred five thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •