Base | Representation |
---|---|
bin | 11101100101011000100001… |
… | …100110100110101100010000 |
3 | 122001200121121002222110122021 |
4 | 131211120201212212230100 |
5 | 114023224444034024404 |
6 | 1140420433345421224 |
7 | 36256206106555240 |
oct | 3545304146465420 |
9 | 561617532873567 |
10 | 130112303033104 |
11 | 38504355050187 |
12 | 1271477703a814 |
13 | 577a6cac49972 |
14 | 241b67d19db20 |
15 | 10097bd961454 |
hex | 7656219a6b10 |
130112303033104 has 80 divisors (see below), whose sum is σ = 300741118479360. Its totient is φ = 53357294960640.
The previous prime is 130112303033087. The next prime is 130112303033159. The reversal of 130112303033104 is 401330303211031.
It is a super-2 number, since 2×1301123030331042 (a number of 29 digits) contains 22 as substring.
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, 210223249 + ... + 210841264.
It is an arithmetic number, because the mean of its divisors is an integer number (3759263980992).
Almost surely, 2130112303033104 is an apocalyptic number.
130112303033104 is a gapful number since it is divisible by the number (14) formed by its first and last digit.
It is an amenable number.
130112303033104 is an abundant number, since it is smaller than the sum of its proper divisors (170628815446256).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
130112303033104 is a wasteful number, since it uses less digits than its factorization.
130112303033104 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 421064648 (or 421064642 counting only the distinct ones).
The product of its (nonzero) digits is 1944, while the sum is 25.
Adding to 130112303033104 its reverse (401330303211031), we get a palindrome (531442606244135).
The spelling of 130112303033104 in words is "one hundred thirty trillion, one hundred twelve billion, three hundred three million, thirty-three thousand, one hundred four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •