Base | Representation |
---|---|
bin | 1100011001101100010111… |
… | …0001111100110001101111 |
3 | 1210021112201112102100022010 |
4 | 3012123011301330301233 |
5 | 3241401043331344210 |
6 | 45000025502452303 |
7 | 2605064334033561 |
oct | 306330561746157 |
9 | 53245645370263 |
10 | 13635544403055 |
11 | 4387890379403 |
12 | 16427b0294093 |
13 | 77ba9856a383 |
14 | 351d6cc09331 |
15 | 189a59c6e920 |
hex | c66c5c7cc6f |
13635544403055 has 16 divisors (see below), whose sum is σ = 21929911832160. Its totient is φ = 7234610085888.
The previous prime is 13635544403023. The next prime is 13635544403057. The reversal of 13635544403055 is 55030444553631.
It is not a de Polignac number, because 13635544403055 - 25 = 13635544403023 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 13635544402995 and 13635544403013.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13635544403057) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2355013410 + ... + 2355019199.
It is an arithmetic number, because the mean of its divisors is an integer number (1370619489510).
Almost surely, 213635544403055 is an apocalyptic number.
13635544403055 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
13635544403055 is a deficient number, since it is larger than the sum of its proper divisors (8294367429105).
13635544403055 is a wasteful number, since it uses less digits than its factorization.
13635544403055 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4710032810.
The product of its (nonzero) digits is 6480000, while the sum is 48.
Adding to 13635544403055 its reverse (55030444553631), we get a palindrome (68665988956686).
The spelling of 13635544403055 in words is "thirteen trillion, six hundred thirty-five billion, five hundred forty-four million, four hundred three thousand, fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •