Base | Representation |
---|---|
bin | 1100000001010110100100… |
… | …0001101101100001110100 |
3 | 1201210120100200121010012221 |
4 | 3000111221001231201310 |
5 | 3213023141331113400 |
6 | 44035551235452124 |
7 | 2532631623625660 |
oct | 300255101554164 |
9 | 51716320533187 |
10 | 13217376426100 |
11 | 4236504464020 |
12 | 1595748757044 |
13 | 74b515c77212 |
14 | 339a1dbb18a0 |
15 | 17dc3338bc1a |
hex | c056906d874 |
13217376426100 has 432 divisors, whose sum is σ = 37158618946176. Its totient is φ = 3964326912000.
The previous prime is 13217376426077. The next prime is 13217376426119. The reversal of 13217376426100 is 162467371231.
It is a super-2 number, since 2×132173764261002 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 143 ways as a sum of consecutive naturals, for example, 2026890840 + ... + 2026897360.
Almost surely, 213217376426100 is an apocalyptic number.
13217376426100 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 13217376426100, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (18579309473088).
13217376426100 is an abundant number, since it is smaller than the sum of its proper divisors (23941242520076).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13217376426100 is a wasteful number, since it uses less digits than its factorization.
13217376426100 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6924 (or 6888 counting only the distinct ones).
The product of its (nonzero) digits is 254016, while the sum is 43.
The spelling of 13217376426100 in words is "thirteen trillion, two hundred seventeen billion, three hundred seventy-six million, four hundred twenty-six thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •