Base | Representation |
---|---|
bin | 1111100100001… |
… | …10100111011000 |
3 | 100002200212222000 |
4 | 13302012213120 |
5 | 231411343213 |
6 | 20542401000 |
7 | 3143603400 |
oct | 762064730 |
9 | 302625860 |
10 | 130574808 |
11 | 67784871 |
12 | 37890160 |
13 | 2108a300 |
14 | 134ad800 |
15 | b6e3c73 |
hex | 7c869d8 |
130574808 has 288 divisors, whose sum is σ = 463136400. Its totient is φ = 33965568.
The previous prime is 130574803. The next prime is 130574819. The reversal of 130574808 is 808475031.
130574808 is a `hidden beast` number, since 1 + 3 + 0 + 574 + 80 + 8 = 666.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (130574803) by changing a digit.
It is a polite number, since it can be written in 71 ways as a sum of consecutive naturals, for example, 1788660 + ... + 1788732.
Almost surely, 2130574808 is an apocalyptic number.
130574808 is a gapful number since it is divisible by the number (18) 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 130574808, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (231568200).
130574808 is an abundant number, since it is smaller than the sum of its proper divisors (332561592).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
130574808 is a wasteful number, since it uses less digits than its factorization.
130574808 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 128 (or 98 counting only the distinct ones).
The product of its (nonzero) digits is 26880, while the sum is 36.
The square root of 130574808 is about 11426.9334469052. The cubic root of 130574808 is about 507.3252351075.
The spelling of 130574808 in words is "one hundred thirty million, five hundred seventy-four thousand, eight hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •