Base | Representation |
---|---|
bin | 1111100010111… |
… | …10101011000000 |
3 | 100002101120112110 |
4 | 13301132223000 |
5 | 231341124300 |
6 | 20535055320 |
7 | 3142322403 |
oct | 761365300 |
9 | 302346473 |
10 | 130411200 |
11 | 67682957 |
12 | 37811540 |
13 | 210309ba |
14 | 13469d3a |
15 | b6b0550 |
hex | 7c5eac0 |
130411200 has 168 divisors, whose sum is σ = 433699920. Its totient is φ = 34304000.
The previous prime is 130411163. The next prime is 130411213. The reversal of 130411200 is 2114031.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (12).
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, 484666 + ... + 484934.
Almost surely, 2130411200 is an apocalyptic number.
130411200 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 130411200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (216849960).
130411200 is an abundant number, since it is smaller than the sum of its proper divisors (303288720).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
130411200 is a wasteful number, since it uses less digits than its factorization.
130411200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 395 (or 380 counting only the distinct ones).
The product of its (nonzero) digits is 24, while the sum is 12.
The square root of 130411200 is about 11419.7723269775. The cubic root of 130411200 is about 507.1132566016.
Adding to 130411200 its reverse (2114031), we get a palindrome (132525231).
It can be divided in two parts, 13041 and 1200, that added together give a palindrome (14241).
The spelling of 130411200 in words is "one hundred thirty million, four hundred eleven thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •