Base | Representation |
---|---|
bin | 1111100011110… |
… | …11110001100000 |
3 | 100002121122001021 |
4 | 13301323301200 |
5 | 231403433100 |
6 | 20541415224 |
7 | 3143330050 |
oct | 761736140 |
9 | 302548037 |
10 | 130530400 |
11 | 67754470 |
12 | 3786a514 |
13 | 21073030 |
14 | 1349b560 |
15 | b6d5a1a |
hex | 7c7bc60 |
130530400 has 288 divisors, whose sum is σ = 430472448. Its totient is φ = 37324800.
The previous prime is 130530397. The next prime is 130530419. The reversal of 130530400 is 4035031.
It is a Harshad number since it is a multiple of its sum of digits (16).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 800719 + ... + 800881.
It is an arithmetic number, because the mean of its divisors is an integer number (1494696).
Almost surely, 2130530400 is an apocalyptic number.
130530400 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 130530400, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (215236224).
130530400 is an abundant number, since it is smaller than the sum of its proper divisors (299942048).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
130530400 is a wasteful number, since it uses less digits than its factorization.
130530400 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 214 (or 201 counting only the distinct ones).
The product of its (nonzero) digits is 180, while the sum is 16.
The square root of 130530400 is about 11424.9901531686. The cubic root of 130530400 is about 507.2677154529.
Adding to 130530400 its reverse (4035031), we get a palindrome (134565431).
The spelling of 130530400 in words is "one hundred thirty million, five hundred thirty thousand, four hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •