Base | Representation |
---|---|
bin | 1100010000001000101111… |
… | …1100111001110011000100 |
3 | 1202200211221121201210212010 |
4 | 3010002023330321303010 |
5 | 3231203324023014120 |
6 | 44352354305454220 |
7 | 2560162664620653 |
oct | 304021374716304 |
9 | 52624847653763 |
10 | 13471365438660 |
11 | 43241a0657468 |
12 | 1616a11041370 |
13 | 7694625ab66c |
14 | 3480362b719a |
15 | 18564b4aa7e0 |
hex | c408bf39cc4 |
13471365438660 has 48 divisors (see below), whose sum is σ = 37863244653696. Its totient is φ = 3578704933632.
The previous prime is 13471365438611. The next prime is 13471365438689. The reversal of 13471365438660 is 6683456317431.
It is a super-3 number, since 3×134713654386603 (a number of 40 digits) contains 333 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 13471365438660.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 426833569 + ... + 426865128.
It is an arithmetic number, because the mean of its divisors is an integer number (788817596952).
Almost surely, 213471365438660 is an apocalyptic number.
13471365438660 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
13471365438660 is an abundant number, since it is smaller than the sum of its proper divisors (24391879215036).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13471365438660 is a wasteful number, since it uses less digits than its factorization.
13471365438660 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 853698972 (or 853698970 counting only the distinct ones).
The product of its (nonzero) digits is 26127360, while the sum is 57.
The spelling of 13471365438660 in words is "thirteen trillion, four hundred seventy-one billion, three hundred sixty-five million, four hundred thirty-eight thousand, six hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.029 sec. • engine limits •