Base | Representation |
---|---|
bin | 1100001001110011001000… |
… | …0100010001011100001001 |
3 | 1202022102220102122221211020 |
4 | 3002130302010101130021 |
5 | 3222412331202114130 |
6 | 44230350130223053 |
7 | 2546256535320441 |
oct | 302346204213411 |
9 | 52272812587736 |
10 | 13362483238665 |
11 | 4291aa747a010 |
12 | 15b98a4724a89 |
13 | 75c0cc8553a2 |
14 | 342a67747121 |
15 | 1828c75b2e10 |
hex | c2732111709 |
13362483238665 has 64 divisors (see below), whose sum is σ = 23874319890432. Its totient is φ = 6325908825600.
The previous prime is 13362483238619. The next prime is 13362483238673. The reversal of 13362483238665 is 56683238426331.
It is not a de Polignac number, because 13362483238665 - 220 = 13362482190089 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 13362483238599 and 13362483238608.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 20157085 + ... + 20809445.
It is an arithmetic number, because the mean of its divisors is an integer number (373036248288).
Almost surely, 213362483238665 is an apocalyptic number.
13362483238665 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
13362483238665 is a deficient number, since it is larger than the sum of its proper divisors (10511836651767).
13362483238665 is a wasteful number, since it uses less digits than its factorization.
13362483238665 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 655310.
The product of its digits is 89579520, while the sum is 60.
The spelling of 13362483238665 in words is "thirteen trillion, three hundred sixty-two billion, four hundred eighty-three million, two hundred thirty-eight thousand, six hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •