Base | Representation |
---|---|
bin | 1100001001011100010011… |
… | …0101101100110101100111 |
3 | 1202021212002101200111211212 |
4 | 3002113010311230311213 |
5 | 3222312304032004022 |
6 | 44223454120422035 |
7 | 2545651642356104 |
oct | 302270465546547 |
9 | 52255071614755 |
10 | 13356355734887 |
11 | 428a442681800 |
12 | 15b867461791b |
13 | 75b6642360c9 |
14 | 342645a27aab |
15 | 1826696913e2 |
hex | c25c4d6cd67 |
13356355734887 has 48 divisors (see below), whose sum is σ = 15052723693056. Its totient is φ = 11837703820800.
The previous prime is 13356355734809. The next prime is 13356355734893. The reversal of 13356355734887 is 78843755365331.
It is not a de Polignac number, because 13356355734887 - 212 = 13356355730791 is a prime.
It is a Smith number, since the sum of its digits (68) coincides with the sum of the digits of its prime factors.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13356355434887) 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 47 ways as a sum of consecutive naturals, for example, 1221202883 + ... + 1221213819.
It is an arithmetic number, because the mean of its divisors is an integer number (313598410272).
Almost surely, 213356355734887 is an apocalyptic number.
13356355734887 is a deficient number, since it is larger than the sum of its proper divisors (1696367958169).
13356355734887 is a wasteful number, since it uses less digits than its factorization.
13356355734887 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12200 (or 12189 counting only the distinct ones).
The product of its digits is 762048000, while the sum is 68.
The spelling of 13356355734887 in words is "thirteen trillion, three hundred fifty-six billion, three hundred fifty-five million, seven hundred thirty-four thousand, eight hundred eighty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •