Base | Representation |
---|---|
bin | 11101100101001111110111… |
… | …110000101100101001110100 |
3 | 122001122201121112120102110220 |
4 | 131211033313300230221310 |
5 | 114023101431320220200 |
6 | 1140412255335214340 |
7 | 36255426620500116 |
oct | 3545176760545164 |
9 | 561581545512426 |
10 | 130103011101300 |
11 | 38500416a962a6 |
12 | 12712a032173b0 |
13 | 5779879b65073 |
14 | 241b03b0b53b6 |
15 | 1009427d1b4a0 |
hex | 7653f7c2ca74 |
130103011101300 has 72 divisors (see below), whose sum is σ = 376888768783296. Its totient is φ = 34651980533760.
The previous prime is 130103011101293. The next prime is 130103011101373. The reversal of 130103011101300 is 3101110301031.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a self number, because there is not a number n which added to its sum of digits gives 130103011101300.
It is a congruent number.
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, 263226189 + ... + 263719988.
Almost surely, 2130103011101300 is an apocalyptic number.
130103011101300 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
130103011101300 is an abundant number, since it is smaller than the sum of its proper divisors (246785757681996).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
130103011101300 is a wasteful number, since it uses less digits than its factorization.
130103011101300 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 526947017 (or 526947010 counting only the distinct ones).
The product of its (nonzero) digits is 27, while the sum is 15.
Adding to 130103011101300 its reverse (3101110301031), we get a palindrome (133204121402331).
The spelling of 130103011101300 in words is "one hundred thirty trillion, one hundred three billion, eleven million, one hundred one thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.097 sec. • engine limits •