Base | Representation |
---|---|
bin | 11000010101001000… |
… | …00100101011100000 |
3 | 1020201022200222100102 |
4 | 30022210010223200 |
5 | 203222401133100 |
6 | 10000050441532 |
7 | 641456163554 |
oct | 141244045340 |
9 | 36638628312 |
10 | 13062130400 |
11 | 55a32609a0 |
12 | 26465932a8 |
13 | 1302216557 |
14 | 8bcadd864 |
15 | 516b25cd5 |
hex | 30a904ae0 |
13062130400 has 144 divisors (see below), whose sum is σ = 35127001728. Its totient is φ = 4703424000.
The previous prime is 13062130397. The next prime is 13062130441. The reversal of 13062130400 is 403126031.
It is a Harshad number since it is a multiple of its sum of digits (20).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 899195 + ... + 913605.
It is an arithmetic number, because the mean of its divisors is an integer number (243937512).
Almost surely, 213062130400 is an apocalyptic number.
13062130400 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 13062130400, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (17563500864).
13062130400 is an abundant number, since it is smaller than the sum of its proper divisors (22064871328).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13062130400 is a wasteful number, since it uses less digits than its factorization.
13062130400 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 14545 (or 14532 counting only the distinct ones).
The product of its (nonzero) digits is 432, while the sum is 20.
Adding to 13062130400 its reverse (403126031), we get a palindrome (13465256431).
The spelling of 13062130400 in words is "thirteen billion, sixty-two million, one hundred thirty thousand, four hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •