Base | Representation |
---|---|
bin | 11001001111010010… |
… | …11100000011000100 |
3 | 1021222022212012000101 |
4 | 30213221130003010 |
5 | 210222304413400 |
6 | 10120321053444 |
7 | 656532514021 |
oct | 144751340304 |
9 | 37868765011 |
10 | 13550076100 |
11 | 5823734800 |
12 | 2761a87284 |
13 | 137c33aa12 |
14 | 927838548 |
15 | 5448ac56a |
hex | 327a5c0c4 |
13550076100 has 216 divisors, whose sum is σ = 36032381280. Its totient is φ = 4392115200.
The previous prime is 13550076097. The next prime is 13550076109. The reversal of 13550076100 is 167005531.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13550076109) by changing a digit.
It is a polite number, since it can be written in 71 ways as a sum of consecutive naturals, for example, 3906567 + ... + 3910033.
It is an arithmetic number, because the mean of its divisors is an integer number (166816580).
Almost surely, 213550076100 is an apocalyptic number.
13550076100 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 13550076100, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (18016190640).
13550076100 is an abundant number, since it is smaller than the sum of its proper divisors (22482305180).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13550076100 is a wasteful number, since it uses less digits than its factorization.
13550076100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3539 (or 3521 counting only the distinct ones).
The product of its (nonzero) digits is 3150, while the sum is 28.
It can be divided in two parts, 135500 and 76100, that added together give a square (211600 = 4602).
The spelling of 13550076100 in words is "thirteen billion, five hundred fifty million, seventy-six thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •