Base | Representation |
---|---|
bin | 1111100100001… |
… | …10110011001100 |
3 | 100002200221000000 |
4 | 13302012303030 |
5 | 231411404224 |
6 | 20542404300 |
7 | 3143605530 |
oct | 762066314 |
9 | 302627000 |
10 | 130575564 |
11 | 67785399 |
12 | 37890690 |
13 | 2108a762 |
14 | 134adbc0 |
15 | b6e40c9 |
hex | 7c86ccc |
130575564 has 84 divisors (see below), whose sum is σ = 391608784. Its totient is φ = 37301472.
The previous prime is 130575547. The next prime is 130575587. The reversal of 130575564 is 465575031.
130575564 is a `hidden beast` number, since 1 + 30 + 575 + 56 + 4 = 666.
It is a tau number, because it is divible by the number of its divisors (84).
It is a Harshad number since it is a multiple of its sum of digits (36).
It is an unprimeable number.
It is a polite number, since it can be written in 27 ways as a sum of consecutive naturals, for example, 17214 + ... + 23610.
Almost surely, 2130575564 is an apocalyptic number.
130575564 is a gapful number since it is divisible by the number (14) 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 130575564, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (195804392).
130575564 is an abundant number, since it is smaller than the sum of its proper divisors (261033220).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
130575564 is an equidigital number, since it uses as much as digits as its factorization.
130575564 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6426 (or 6409 counting only the distinct ones).
The product of its (nonzero) digits is 63000, while the sum is 36.
The square root of 130575564 is about 11426.9665265984. The cubic root of 130575564 is about 507.3262142069.
The spelling of 130575564 in words is "one hundred thirty million, five hundred seventy-five thousand, five hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •