Base | Representation |
---|---|
bin | 100010000111101110111011… |
… | …0001010101111000110001101 |
3 | 1110100200010222220000202110022 |
4 | 1010033131312022233012031 |
5 | 303314312221030444041 |
6 | 2542153453010351525 |
7 | 120134451146121164 |
oct | 10417356612570615 |
9 | 1410603886022408 |
10 | 300130002203021 |
11 | 876a3467963831 |
12 | 297b325658b5a5 |
13 | cb611a389b2c3 |
14 | 54185263163db |
15 | 24a710b9aa24b |
hex | 110f7762af18d |
300130002203021 has 16 divisors (see below), whose sum is σ = 309951261442560. Its totient is φ = 290317495818240.
The previous prime is 300130002202993. The next prime is 300130002203039. The reversal of 300130002203021 is 120302200031003.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-300130002203021 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (300130002203081) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 740224670 + ... + 740630016.
It is an arithmetic number, because the mean of its divisors is an integer number (19371953840160).
Almost surely, 2300130002203021 is an apocalyptic number.
300130002203021 is a gapful number since it is divisible by the number (31) formed by its first and last digit.
It is an amenable number.
300130002203021 is a deficient number, since it is larger than the sum of its proper divisors (9821259239539).
300130002203021 is a wasteful number, since it uses less digits than its factorization.
300130002203021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 416084.
The product of its (nonzero) digits is 216, while the sum is 17.
Adding to 300130002203021 its reverse (120302200031003), we get a palindrome (420432202234024).
The spelling of 300130002203021 in words is "three hundred trillion, one hundred thirty billion, two million, two hundred three thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •