Base | Representation |
---|---|
bin | 1100101000010111111101… |
… | …1110110100100110111101 |
3 | 1211011122202102201101100101 |
4 | 3022011333132310212331 |
5 | 3310014122110213310 |
6 | 45311541431001101 |
7 | 2632233560506363 |
oct | 312057736644675 |
9 | 54148672641311 |
10 | 13887768054205 |
11 | 4474851016681 |
12 | 1683661509191 |
13 | 7997c321bb76 |
14 | 360258a93633 |
15 | 1913bcdc843a |
hex | ca17f7b49bd |
13887768054205 has 8 divisors (see below), whose sum is σ = 16665868377432. Its totient is φ = 11109849968448.
The previous prime is 13887768054203. The next prime is 13887768054337. The reversal of 13887768054205 is 50245086778831.
It can be written as a sum of positive squares in 4 ways, for example, as 1708149669444 + 12179618384761 = 1306962^2 + 3489931^2 .
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 13887768054205 - 21 = 13887768054203 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13887768054203) 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, 45391654 + ... + 45696583.
It is an arithmetic number, because the mean of its divisors is an integer number (2083233547179).
Almost surely, 213887768054205 is an apocalyptic number.
It is an amenable number.
13887768054205 is a deficient number, since it is larger than the sum of its proper divisors (2778100323227).
13887768054205 is an equidigital number, since it uses as much as digits as its factorization.
13887768054205 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 91118735.
The product of its (nonzero) digits is 90316800, while the sum is 64.
The spelling of 13887768054205 in words is "thirteen trillion, eight hundred eighty-seven billion, seven hundred sixty-eight million, fifty-four thousand, two hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •