Base | Representation |
---|---|
bin | 111100110100100010… |
… | …1110100010011000000 |
3 | 110111010120210202121011 |
4 | 1321221011310103000 |
5 | 4114443202321423 |
6 | 140000303410304 |
7 | 12302455653400 |
oct | 1715105642300 |
9 | 414116722534 |
10 | 130612151488 |
11 | 50435177655 |
12 | 213918b3994 |
13 | c416966350 |
14 | 64708d6800 |
15 | 35e6981b0d |
hex | 1e691744c0 |
130612151488 has 168 divisors, whose sum is σ = 325057160400. Its totient is φ = 51612567552.
The previous prime is 130612151441. The next prime is 130612151521. The reversal of 130612151488 is 884151216031.
It is a super-2 number, since 2×1306121514882 (a number of 23 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 130612151488.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 64371658 + ... + 64373686.
It is an arithmetic number, because the mean of its divisors is an integer number (1934864050).
Almost surely, 2130612151488 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 130612151488, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (162528580200).
130612151488 is an abundant number, since it is smaller than the sum of its proper divisors (194445008912).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
130612151488 is a wasteful number, since it uses less digits than its factorization.
130612151488 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3647 (or 3630 counting only the distinct ones).
The product of its (nonzero) digits is 46080, while the sum is 40.
The spelling of 130612151488 in words is "one hundred thirty billion, six hundred twelve million, one hundred fifty-one thousand, four hundred eighty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.172 sec. • engine limits •