Base | Representation |
---|---|
bin | 11000101110000000… |
… | …11000001010000000 |
3 | 1021020212111101120120 |
4 | 30113000120022000 |
5 | 204134321024200 |
6 | 10032504540240 |
7 | 646602406626 |
oct | 142700301200 |
9 | 37225441516 |
10 | 13270876800 |
11 | 56a0078185 |
12 | 26a4481680 |
13 | 133654392c |
14 | 8dc71b516 |
15 | 52a10b9a0 |
hex | 317018280 |
13270876800 has 384 divisors, whose sum is σ = 47516006400. Its totient is φ = 3243110400.
The previous prime is 13270876799. The next prime is 13270876823. The reversal of 13270876800 is 867807231.
It is a tau number, because it is divible by the number of its divisors (384).
It is a super-2 number, since 2×132708768002 (a number of 21 digits) contains 22 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 5653227 + ... + 5655573.
It is an arithmetic number, because the mean of its divisors is an integer number (123739600).
Almost surely, 213270876800 is an apocalyptic number.
13270876800 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 13270876800, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (23758003200).
13270876800 is an abundant number, since it is smaller than the sum of its proper divisors (34245129600).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13270876800 is a wasteful number, since it uses less digits than its factorization.
13270876800 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2424 (or 2407 counting only the distinct ones).
The product of its (nonzero) digits is 112896, while the sum is 42.
The spelling of 13270876800 in words is "thirteen billion, two hundred seventy million, eight hundred seventy-six thousand, eight hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •