Base | Representation |
---|---|
bin | 1000101111000010100… |
… | …01001101110110100011 |
3 | 1001200200201112221022122 |
4 | 10113201101031312203 |
5 | 14404132311131321 |
6 | 345513453054455 |
7 | 30453361004534 |
oct | 4274121156643 |
9 | 1050621487278 |
10 | 300132130211 |
11 | 106315843721 |
12 | 4a20178742b |
13 | 223c1311b74 |
14 | 107528d868b |
15 | 7c190ad8ab |
hex | 45e144dda3 |
300132130211 has 8 divisors (see below), whose sum is σ = 304639870800. Its totient is φ = 295625217888.
The previous prime is 300132130159. The next prime is 300132130217. The reversal of 300132130211 is 112031231003.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-300132130211 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 300132130211.
It is not an unprimeable number, because it can be changed into a prime (300132130217) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 543365 + ... + 946313.
It is an arithmetic number, because the mean of its divisors is an integer number (38079983850).
Almost surely, 2300132130211 is an apocalyptic number.
300132130211 is a deficient number, since it is larger than the sum of its proper divisors (4507740589).
300132130211 is a wasteful number, since it uses less digits than its factorization.
300132130211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 414133.
The product of its (nonzero) digits is 108, while the sum is 17.
Adding to 300132130211 its reverse (112031231003), we get a palindrome (412163361214).
The spelling of 300132130211 in words is "three hundred billion, one hundred thirty-two million, one hundred thirty thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •