Base | Representation |
---|---|
bin | 1100010101100110100000… |
… | …0111111101111110100111 |
3 | 1210000211021211221121122022 |
4 | 3011121220013331332213 |
5 | 3234223114412440403 |
6 | 44503442543453355 |
7 | 2600025426305534 |
oct | 305315007757647 |
9 | 53024254847568 |
10 | 13565253640103 |
11 | 435aaa0041880 |
12 | 1631053bb725b |
13 | 775275b0a449 |
14 | 34c7c1745d8b |
15 | 187ce3d76d38 |
hex | c56681fdfa7 |
13565253640103 has 8 divisors (see below), whose sum is σ = 14798509610256. Its totient is φ = 12332006185600.
The previous prime is 13565253640079. The next prime is 13565253640181. The reversal of 13565253640103 is 30104635256531.
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 13565253640103 - 210 = 13565253639079 is a prime.
It is a super-2 number, since 2×135652536401032 (a number of 27 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 (13565253640703) 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, 1465775 + ... + 5411007.
It is an arithmetic number, because the mean of its divisors is an integer number (1849813701282).
Almost surely, 213565253640103 is an apocalyptic number.
13565253640103 is a deficient number, since it is larger than the sum of its proper divisors (1233255970153).
13565253640103 is a wasteful number, since it uses less digits than its factorization.
13565253640103 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4257825.
The product of its (nonzero) digits is 972000, while the sum is 44.
Adding to 13565253640103 its reverse (30104635256531), we get a palindrome (43669888896634).
The spelling of 13565253640103 in words is "thirteen trillion, five hundred sixty-five billion, two hundred fifty-three million, six hundred forty thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •