Base | Representation |
---|---|
bin | 11000010010111111… |
… | …10100111010000000 |
3 | 1020200002001001100000 |
4 | 30021133310322000 |
5 | 203203311140000 |
6 | 5554211200000 |
7 | 641151132141 |
oct | 141137647200 |
9 | 36602031300 |
10 | 13044240000 |
11 | 5594151640 |
12 | 26405a6000 |
13 | 12cb5c140c |
14 | 8ba5a3ac8 |
15 | 515290000 |
hex | 3097f4e80 |
13044240000 has 960 divisors, whose sum is σ = 53934360480. Its totient is φ = 3110400000.
The previous prime is 13044239909. The next prime is 13044240007. The reversal of 13044240000 is 4244031.
It is a tau number, because it is divible by the number of its divisors (960).
It is a Harshad number since it is a multiple of its sum of digits (18).
It is not an unprimeable number, because it can be changed into a prime (13044240007) by changing a digit.
It is a polite number, since it can be written in 119 ways as a sum of consecutive naturals, for example, 213839970 + ... + 213840030.
Almost surely, 213044240000 is an apocalyptic number.
13044240000 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 13044240000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (26967180240).
13044240000 is an abundant number, since it is smaller than the sum of its proper divisors (40890120480).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13044240000 is an frugal number, since it uses more digits than its factorization.
13044240000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 121 (or 82 counting only the distinct ones).
The product of its (nonzero) digits is 384, while the sum is 18.
Adding to 13044240000 its reverse (4244031), we get a palindrome (13048484031).
The spelling of 13044240000 in words is "thirteen billion, forty-four million, two hundred forty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.157 sec. • engine limits •