Base | Representation |
---|---|
bin | 1100010101000100110100… |
… | …1010000010111111111011 |
3 | 1202222221221200010101122101 |
4 | 3011101031022002333323 |
5 | 3234101110040444111 |
6 | 44455345410204231 |
7 | 2566255360346464 |
oct | 305211512027773 |
9 | 52887850111571 |
10 | 13556211265531 |
11 | 435717a938a40 |
12 | 162b34b883677 |
13 | 77446464184c |
14 | 34c1a485dd6b |
15 | 1879650c9bc1 |
hex | c544d282ffb |
13556211265531 has 16 divisors (see below), whose sum is σ = 15605761564800. Its totient is φ = 11646090576000.
The previous prime is 13556211265511. The next prime is 13556211265589.
13556211265531 is nontrivially palindromic in base 10.
It is a cyclic number.
It is not a de Polignac number, because 13556211265531 - 221 = 13556209168379 is a prime.
It is a super-2 number, since 2×135562112655312 (a number of 27 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (13556211265511) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 80791821 + ... + 80959438.
It is an arithmetic number, because the mean of its divisors is an integer number (975360097800).
Almost surely, 213556211265531 is an apocalyptic number.
13556211265531 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
13556211265531 is a deficient number, since it is larger than the sum of its proper divisors (2049550299269).
13556211265531 is a wasteful number, since it uses less digits than its factorization.
13556211265531 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 161751690.
The product of its digits is 810000, while the sum is 46.
The spelling of 13556211265531 in words is "thirteen trillion, five hundred fifty-six billion, two hundred eleven million, two hundred sixty-five thousand, five hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.858 sec. • engine limits •