Base | Representation |
---|---|
bin | 11101100101011001011000… |
… | …011001011000000001000000 |
3 | 122001200200222011202200012210 |
4 | 131211121120121120001000 |
5 | 114023233334402441000 |
6 | 1140421104505022120 |
7 | 36256240641400524 |
oct | 3545313031300100 |
9 | 561620864680183 |
10 | 130113222312000 |
11 | 38504786a50004 |
12 | 12714992a84940 |
13 | 577a816533485 |
14 | 241b7292d7d84 |
15 | 10098244ea350 |
hex | 765658658040 |
130113222312000 has 896 divisors, whose sum is σ = 444609048499200. Its totient is φ = 33502740480000.
The previous prime is 130113222311981. The next prime is 130113222312041. The reversal of 130113222312000 is 213222311031.
It is an unprimeable number.
It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 95601191320 + ... + 95601192680.
Almost surely, 2130113222312000 is an apocalyptic number.
130113222312000 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 130113222312000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (222304524249600).
130113222312000 is an abundant number, since it is smaller than the sum of its proper divisors (314495826187200).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
130113222312000 is a wasteful number, since it uses less digits than its factorization.
130113222312000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2168 (or 2148 counting only the distinct ones).
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 130113222312000 its reverse (213222311031), we get a palindrome (130326444623031).
The spelling of 130113222312000 in words is "one hundred thirty trillion, one hundred thirteen billion, two hundred twenty-two million, three hundred twelve thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •