Base | Representation |
---|---|
bin | 11000001110010001… |
… | …10110110111101100 |
3 | 1020120022120101200100 |
4 | 30013020312313230 |
5 | 203113143224200 |
6 | 5550235031100 |
7 | 640160552115 |
oct | 140710666754 |
9 | 36508511610 |
10 | 13004664300 |
11 | 5573880851 |
12 | 262b29b490 |
13 | 12c3345a44 |
14 | 8b522120c |
15 | 511a73d00 |
hex | 307236dec |
13004664300 has 216 divisors, whose sum is σ = 43530963840. Its totient is φ = 3240115200.
The previous prime is 13004664293. The next prime is 13004664311. The reversal of 13004664300 is 346640031.
13004664300 is a `hidden beast` number, since 13 + 0 + 0 + 4 + 6 + 643 + 0 + 0 = 666.
It is an unprimeable number.
It is a polite number, since it can be written in 71 ways as a sum of consecutive naturals, for example, 801064 + ... + 817136.
It is an arithmetic number, because the mean of its divisors is an integer number (201532240).
Almost surely, 213004664300 is an apocalyptic number.
13004664300 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 13004664300, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (21765481920).
13004664300 is an abundant number, since it is smaller than the sum of its proper divisors (30526299540).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13004664300 is a wasteful number, since it uses less digits than its factorization.
13004664300 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 16153 (or 16143 counting only the distinct ones).
The product of its (nonzero) digits is 5184, while the sum is 27.
It can be divided in two parts, 1300 and 4664300, that added together give a square (4665600 = 21602).
The spelling of 13004664300 in words is "thirteen billion, four million, six hundred sixty-four thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •