Base | Representation |
---|---|
bin | 11101100101100010100111… |
… | …000111101100000011000000 |
3 | 122001201122112212111022011211 |
4 | 131211202213013230003000 |
5 | 114023414134022310422 |
6 | 1140425424141415504 |
7 | 36260041353055234 |
oct | 3545424707540300 |
9 | 561648485438154 |
10 | 130123133010112 |
11 | 38508a02310200 |
12 | 12716899b6a594 |
13 | 577b735884698 |
14 | 241bdc96525c4 |
15 | 1009c04618577 |
hex | 7658a71ec0c0 |
130123133010112 has 42 divisors (see below), whose sum is σ = 283821002040884. Its totient is φ = 59146878637440.
The previous prime is 130123133010103. The next prime is 130123133010121. The reversal of 130123133010112 is 211010331321031.
It is an interprime number because it is at equal distance from previous prime (130123133010103) and next prime (130123133010121).
It is a Harshad number since it is a multiple of its sum of digits (22).
It is an unprimeable number.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 8401537518 + ... + 8401553005.
Almost surely, 2130123133010112 is an apocalyptic number.
It is an amenable number.
130123133010112 is an abundant number, since it is smaller than the sum of its proper divisors (153697869030772).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
130123133010112 is a wasteful number, since it uses less digits than its factorization.
130123133010112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16803090557 (or 16803090536 counting only the distinct ones).
The product of its (nonzero) digits is 324, while the sum is 22.
Adding to 130123133010112 its reverse (211010331321031), we get a palindrome (341133464331143).
It can be divided in two parts, 1301231 and 33010112, that added together give a palindrome (34311343).
The spelling of 130123133010112 in words is "one hundred thirty trillion, one hundred twenty-three billion, one hundred thirty-three million, ten thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •