Base | Representation |
---|---|
bin | 111100101111011100… |
… | …1001100101111000000 |
3 | 110110200122220000001020 |
4 | 1321132321030233000 |
5 | 4114120403242202 |
6 | 135531312505440 |
7 | 12265310546151 |
oct | 1713671145700 |
9 | 413618800036 |
10 | 130441071552 |
11 | 50357647780 |
12 | 2134454b280 |
13 | c3ba39660c |
14 | 6455cc1928 |
15 | 35d693b5bc |
hex | 1e5ee4cbc0 |
130441071552 has 112 divisors (see below), whose sum is σ = 376861693824. Its totient is φ = 39489664000.
The previous prime is 130441071511. The next prime is 130441071581. The reversal of 130441071552 is 255170144031.
It is a Harshad number since it is a multiple of its sum of digits (33).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2211727 + ... + 2269937.
It is an arithmetic number, because the mean of its divisors is an integer number (3364836552).
Almost surely, 2130441071552 is an apocalyptic number.
130441071552 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 130441071552, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (188430846912).
130441071552 is an abundant number, since it is smaller than the sum of its proper divisors (246420622272).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
130441071552 is a wasteful number, since it uses less digits than its factorization.
130441071552 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 59298 (or 59288 counting only the distinct ones).
The product of its (nonzero) digits is 16800, while the sum is 33.
The spelling of 130441071552 in words is "one hundred thirty billion, four hundred forty-one million, seventy-one thousand, five hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •