Base | Representation |
---|---|
bin | 11101101000000111101000… |
… | …111001010101011101111000 |
3 | 122002100120221001021100212200 |
4 | 131220013220321111131320 |
5 | 114034320034012444000 |
6 | 1141043051220310200 |
7 | 36305613436256106 |
oct | 3550075071253570 |
9 | 562316831240780 |
10 | 130300330203000 |
11 | 38577072527971 |
12 | 127450b0b42360 |
13 | 5792364928089 |
14 | 24267d90d6c76 |
15 | 100e625c30500 |
hex | 7681e8e55778 |
130300330203000 has 96 divisors (see below), whose sum is σ = 440415116116560. Its totient is φ = 34746754718400.
The previous prime is 130300330202983. The next prime is 130300330203013. The reversal of 130300330203000 is 302033003031.
130300330203000 is a `hidden beast` number, since 1 + 3 + 0 + 30 + 0 + 330 + 2 + 0 + 300 + 0 = 666.
It is a Harshad number since it is a multiple of its sum of digits (18).
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, 7238898234 + ... + 7238916233.
Almost surely, 2130300330203000 is an apocalyptic number.
130300330203000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
130300330203000 is an abundant number, since it is smaller than the sum of its proper divisors (310114785913560).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
130300330203000 is a wasteful number, since it uses less digits than its factorization.
130300330203000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14477814494 (or 14477814477 counting only the distinct ones).
The product of its (nonzero) digits is 486, while the sum is 18.
Adding to 130300330203000 its reverse (302033003031), we get a palindrome (130602363206031).
The spelling of 130300330203000 in words is "one hundred thirty trillion, three hundred billion, three hundred thirty million, two hundred three thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •