Base | Representation |
---|---|
bin | 111100110011110010… |
… | …0001100101111011100 |
3 | 110111001210122122201211 |
4 | 1321213210030233130 |
5 | 4114420124432000 |
6 | 135553551114204 |
7 | 12302025313123 |
oct | 1714744145734 |
9 | 414053578654 |
10 | 130586561500 |
11 | 504217894aa |
12 | 21385212964 |
13 | c411576745 |
14 | 646b354aba |
15 | 35e45c97ba |
hex | 1e6790cbdc |
130586561500 has 48 divisors (see below), whose sum is σ = 285488199360. Its totient is φ = 52182033600.
The previous prime is 130586561449. The next prime is 130586561503. The reversal of 130586561500 is 5165685031.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (130586561503) 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, 367521 + ... + 629479.
It is an arithmetic number, because the mean of its divisors is an integer number (5947670820).
Almost surely, 2130586561500 is an apocalyptic number.
130586561500 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 130586561500, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (142744099680).
130586561500 is an abundant number, since it is smaller than the sum of its proper divisors (154901637860).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
130586561500 is a wasteful number, since it uses less digits than its factorization.
130586561500 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 262975 (or 262963 counting only the distinct ones).
The product of its (nonzero) digits is 108000, while the sum is 40.
The spelling of 130586561500 in words is "one hundred thirty billion, five hundred eighty-six million, five hundred sixty-one thousand, five hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •