Base | Representation |
---|---|
bin | 11000010111100000… |
… | …10000100111000000 |
3 | 1020202201021122112000 |
4 | 30023300100213000 |
5 | 203243004232313 |
6 | 10002042504000 |
7 | 642121014450 |
oct | 141360204700 |
9 | 36681248460 |
10 | 13082102208 |
11 | 560356201a |
12 | 2651205000 |
13 | 13063b9ba6 |
14 | 8c161bd60 |
15 | 51876d673 |
hex | 30bc109c0 |
13082102208 has 448 divisors, whose sum is σ = 47033809920. Its totient is φ = 3480551424.
The previous prime is 13082102161. The next prime is 13082102213. The reversal of 13082102208 is 80220128031.
It is a tau number, because it is divible by the number of its divisors (448).
It is a super-2 number, since 2×130821022082 (a number of 21 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 23236135 + ... + 23236697.
Almost surely, 213082102208 is an apocalyptic number.
13082102208 is a gapful number since it is divisible by the number (18) 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 13082102208, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (23516904960).
13082102208 is an abundant number, since it is smaller than the sum of its proper divisors (33951707712).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13082102208 is a wasteful number, since it uses less digits than its factorization.
13082102208 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 721 (or 705 counting only the distinct ones).
The product of its (nonzero) digits is 1536, while the sum is 27.
The spelling of 13082102208 in words is "thirteen billion, eighty-two million, one hundred two thousand, two hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.373 sec. • engine limits •