Base | Representation |
---|---|
bin | 1111100100101… |
… | …10110001101000 |
3 | 100002211020202120 |
4 | 13302112301220 |
5 | 231421003000 |
6 | 20544031240 |
7 | 3144300360 |
oct | 762266150 |
9 | 302736676 |
10 | 130641000 |
11 | 6781a576 |
12 | 37902520 |
13 | 210b1489 |
14 | 134c99a0 |
15 | b7086a0 |
hex | 7c96c68 |
130641000 has 128 divisors (see below), whose sum is σ = 465903360. Its totient is φ = 29856000.
The previous prime is 130640999. The next prime is 130641011. The reversal of 130641000 is 146031.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 17890 + ... + 24110.
It is an arithmetic number, because the mean of its divisors is an integer number (3639870).
Almost surely, 2130641000 is an apocalyptic number.
130641000 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 130641000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (232951680).
130641000 is an abundant number, since it is smaller than the sum of its proper divisors (335262360).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
130641000 is a wasteful number, since it uses less digits than its factorization.
130641000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6252 (or 6238 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 15.
The square root of 130641000 is about 11429.8293950522. The cubic root of 130641000 is about 507.4109463809.
Adding to 130641000 its reverse (146031), we get a palindrome (130787031).
The spelling of 130641000 in words is "one hundred thirty million, six hundred forty-one thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •