Base | Representation |
---|---|
bin | 1100001100001010011101… |
… | …1001100011100010010011 |
3 | 1202110022202112102022011221 |
4 | 3003002213121203202103 |
5 | 3224044030223121442 |
6 | 44301145130545511 |
7 | 2552225321064466 |
oct | 303024731434223 |
9 | 52408675368157 |
10 | 13403106457747 |
11 | 42a82531a4846 |
12 | 1605741298297 |
13 | 762ba4a72c26 |
14 | 3449dc9c32dd |
15 | 1839a3b52467 |
hex | c30a7663893 |
13403106457747 has 8 divisors (see below), whose sum is σ = 13603506354176. Its totient is φ = 13202716959432.
The previous prime is 13403106457703. The next prime is 13403106457753. The reversal of 13403106457747 is 74775460130431.
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 13403106457747 - 235 = 13368746719379 is a prime.
It is a super-3 number, since 3×134031064577473 (a number of 40 digits) contains 333 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 13403106457694 and 13403106457703.
It is not an unprimeable number, because it can be changed into a prime (13403106457757) 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, 17278 + ... + 5177500.
It is an arithmetic number, because the mean of its divisors is an integer number (1700438294272).
Almost surely, 213403106457747 is an apocalyptic number.
13403106457747 is a deficient number, since it is larger than the sum of its proper divisors (200399896429).
13403106457747 is an equidigital number, since it uses as much as digits as its factorization.
13403106457747 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5199057.
The product of its (nonzero) digits is 5927040, while the sum is 52.
The spelling of 13403106457747 in words is "thirteen trillion, four hundred three billion, one hundred six million, four hundred fifty-seven thousand, seven hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •