Base | Representation |
---|---|
bin | 1100001101000011110001… |
… | …1010010110010001000000 |
3 | 1202111210110201211221210110 |
4 | 3003100330122112101000 |
5 | 3224322032242410413 |
6 | 44312211515031320 |
7 | 2553311503516620 |
oct | 303207432262100 |
9 | 52453421757713 |
10 | 13418491372608 |
11 | 4303828619013 |
12 | 160871573b540 |
13 | 76448727b24a |
14 | 34565bda2880 |
15 | 1840a464a8c3 |
hex | c343c696440 |
13418491372608 has 112 divisors (see below), whose sum is σ = 42710486405120. Its totient is φ = 3632072845824.
The previous prime is 13418491372603. The next prime is 13418491372619. The reversal of 13418491372608 is 80627319481431.
It is a tau number, because it is divible by the number of its divisors (112).
It is a super-3 number, since 3×134184913726083 (a number of 40 digits) contains 333 as substring.
It is a Harshad number since it is a multiple of its sum of digits (57).
It is not an unprimeable number, because it can be changed into a prime (13418491372603) by changing a digit.
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 15 ways as a sum of consecutive naturals, for example, 262711216 + ... + 262762287.
Almost surely, 213418491372608 is an apocalyptic number.
It is an amenable number.
13418491372608 is an abundant number, since it is smaller than the sum of its proper divisors (29291995032512).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13418491372608 is a wasteful number, since it uses less digits than its factorization.
13418491372608 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 525473544 (or 525473534 counting only the distinct ones).
The product of its (nonzero) digits is 6967296, while the sum is 57.
The spelling of 13418491372608 in words is "thirteen trillion, four hundred eighteen billion, four hundred ninety-one million, three hundred seventy-two thousand, six hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •