Base | Representation |
---|---|
bin | 1000101110110010111… |
… | …01011011000000110001 |
3 | 1001200100121000112021111 |
4 | 10113121131123000301 |
5 | 14403400241041423 |
6 | 345452452553321 |
7 | 30450210243553 |
oct | 4273135330061 |
9 | 1050317015244 |
10 | 300001112113 |
11 | 1062588968aa |
12 | 4a185922841 |
13 | 223a012ab71 |
14 | 1073d3514d3 |
15 | 7c0c82d60d |
hex | 45d975b031 |
300001112113 has 8 divisors (see below), whose sum is σ = 306418106432. Its totient is φ = 293641158096.
The previous prime is 300001112101. The next prime is 300001112153. The reversal of 300001112113 is 311211100003.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 300001112113 - 229 = 299464241201 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 300001112093 and 300001112102.
It is not an unprimeable number, because it can be changed into a prime (300001112153) 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, 14249445 + ... + 14270482.
It is an arithmetic number, because the mean of its divisors is an integer number (38302263304).
Almost surely, 2300001112113 is an apocalyptic number.
It is an amenable number.
300001112113 is a deficient number, since it is larger than the sum of its proper divisors (6416994319).
300001112113 is a wasteful number, since it uses less digits than its factorization.
300001112113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 28520151.
The product of its (nonzero) digits is 18, while the sum is 13.
Adding to 300001112113 its reverse (311211100003), we get a palindrome (611212212116).
The spelling of 300001112113 in words is "three hundred billion, one million, one hundred twelve thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •