Base | Representation |
---|---|
bin | 11000100000100000… |
… | …10110011111111000 |
3 | 1020221222101112200000 |
4 | 30100100112133320 |
5 | 203421322430200 |
6 | 10013341313000 |
7 | 644025646146 |
oct | 142020263770 |
9 | 36858345600 |
10 | 13157623800 |
11 | 5642154562 |
12 | 2672565760 |
13 | 1318c3ca19 |
14 | 8cb67a596 |
15 | 5201da300 |
hex | 3104167f8 |
13157623800 has 576 divisors, whose sum is σ = 48746880000. Its totient is φ = 3291425280.
The previous prime is 13157623763. The next prime is 13157623847. The reversal of 13157623800 is 832675131.
13157623800 is a `hidden beast` number, since 1 + 3 + 1 + 576 + 2 + 3 + 80 + 0 = 666.
It is a Harshad number since it is a multiple of its sum of digits (36).
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, 88306126 + ... + 88306274.
It is an arithmetic number, because the mean of its divisors is an integer number (84630000).
Almost surely, 213157623800 is an apocalyptic number.
13157623800 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 13157623800, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (24373440000).
13157623800 is an abundant number, since it is smaller than the sum of its proper divisors (35589256200).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13157623800 is a wasteful number, since it uses less digits than its factorization.
13157623800 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 282 (or 261 counting only the distinct ones).
The product of its (nonzero) digits is 30240, while the sum is 36.
The spelling of 13157623800 in words is "thirteen billion, one hundred fifty-seven million, six hundred twenty-three thousand, eight hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •