Base | Representation |
---|---|
bin | 1100001010101100011000… |
… | …1000001101010010101011 |
3 | 1202100220120112002002110101 |
4 | 3002223012020031102223 |
5 | 3223140320130400412 |
6 | 44241411144330231 |
7 | 2550342435326263 |
oct | 302530610152253 |
9 | 52326515062411 |
10 | 13377852200107 |
11 | 429857389723a |
12 | 1600873773977 |
13 | 7606ab966105 |
14 | 3436c49727a3 |
15 | 182ec69a9457 |
hex | c2ac620d4ab |
13377852200107 has 8 divisors (see below), whose sum is σ = 13430344752000. Its totient is φ = 13325394290880.
The previous prime is 13377852200099. The next prime is 13377852200203. The reversal of 13377852200107 is 70100225877331.
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 13377852200107 - 23 = 13377852200099 is a prime.
It is a super-2 number, since 2×133778522001072 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (13377852200407) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 7886683 + ... + 9431620.
It is an arithmetic number, because the mean of its divisors is an integer number (1678793094000).
Almost surely, 213377852200107 is an apocalyptic number.
13377852200107 is a deficient number, since it is larger than the sum of its proper divisors (52492551893).
13377852200107 is a wasteful number, since it uses less digits than its factorization.
13377852200107 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17321333.
The product of its (nonzero) digits is 493920, while the sum is 46.
The spelling of 13377852200107 in words is "thirteen trillion, three hundred seventy-seven billion, eight hundred fifty-two million, two hundred thousand, one hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.135 sec. • engine limits •