Base | Representation |
---|---|
bin | 11101100100001011111111… |
… | …101101110100010101000000 |
3 | 122001101202111100010222020012 |
4 | 131210023333231310111000 |
5 | 114020403201302320000 |
6 | 1140315003411004052 |
7 | 36250236561411065 |
oct | 3544137755642500 |
9 | 561352440128205 |
10 | 130030130120000 |
11 | 38482517635350 |
12 | 12700863599628 |
13 | 5772a338a8566 |
14 | 24176c59d8c6c |
15 | 10075ae826735 |
hex | 7642ffb74540 |
130030130120000 has 280 divisors, whose sum is σ = 352945348110432. Its totient is φ = 47122259200000.
The previous prime is 130030130119969. The next prime is 130030130120147. The reversal of 130030130120000 is 21031030031.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 39 ways as a sum of consecutive naturals, for example, 128415695 + ... + 129424305.
Almost surely, 2130030130120000 is an apocalyptic number.
130030130120000 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 130030130120000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (176472674055216).
130030130120000 is an abundant number, since it is smaller than the sum of its proper divisors (222915217990432).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
130030130120000 is a wasteful number, since it uses less digits than its factorization.
130030130120000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1008947 (or 1008922 counting only the distinct ones).
The product of its (nonzero) digits is 54, while the sum is 14.
Adding to 130030130120000 its reverse (21031030031), we get a palindrome (130051161150031).
The spelling of 130030130120000 in words is "one hundred thirty trillion, thirty billion, one hundred thirty million, one hundred twenty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.036 sec. • engine limits •