Base | Representation |
---|---|
bin | 1111100101100… |
… | …00010010000000 |
3 | 100010000120001220 |
4 | 13302300102000 |
5 | 231432323342 |
6 | 20550155040 |
7 | 3145214064 |
oct | 762602200 |
9 | 303016056 |
10 | 130745472 |
11 | 67891010 |
12 | 37952a80 |
13 | 21119bb0 |
14 | 13515aa4 |
15 | b7295ec |
hex | 7cb0480 |
130745472 has 128 divisors (see below), whose sum is σ = 408179520. Its totient is φ = 36556800.
The previous prime is 130745443. The next prime is 130745473. The reversal of 130745472 is 274547031.
It is a tau number, because it is divible by the number of its divisors (128).
It is a Harshad number since it is a multiple of its sum of digits (33).
It is not an unprimeable number, because it can be changed into a prime (130745473) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 53722 + ... + 56102.
Almost surely, 2130745472 is an apocalyptic number.
130745472 is a gapful number since it is divisible by the number (12) 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 130745472, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (204089760).
130745472 is an abundant number, since it is smaller than the sum of its proper divisors (277434048).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
130745472 is a wasteful number, since it uses less digits than its factorization.
130745472 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2422 (or 2410 counting only the distinct ones).
The product of its (nonzero) digits is 23520, while the sum is 33.
The square root of 130745472 is about 11434.3986286993. The cubic root of 130745472 is about 507.5461671057.
The spelling of 130745472 in words is "one hundred thirty million, seven hundred forty-five thousand, four hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •