Base | Representation |
---|---|
bin | 10001111001111… |
… | …100110100101011 |
3 | 202221021002211111 |
4 | 101321330310223 |
5 | 1103400412021 |
6 | 45450411151 |
7 | 10305251305 |
oct | 2171746453 |
9 | 687232744 |
10 | 300404011 |
11 | 14462aa86 |
12 | 84730ab7 |
13 | 4a30c96b |
14 | 2bc7a975 |
15 | 1b58d8e1 |
hex | 11e7cd2b |
300404011 has 8 divisors (see below), whose sum is σ = 310974480. Its totient is φ = 289847712.
The previous prime is 300403993. The next prime is 300404017. The reversal of 300404011 is 110404003.
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 300404011 - 211 = 300401963 is a prime.
It is a super-4 number, since 4×3004040114 (a number of 35 digits) contains 4444 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 300403982 and 300404000.
It is not an unprimeable number, because it can be changed into a prime (300404017) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 57921 + ... + 62893.
It is an arithmetic number, because the mean of its divisors is an integer number (38871810).
Almost surely, 2300404011 is an apocalyptic number.
300404011 is a deficient number, since it is larger than the sum of its proper divisors (10570469).
300404011 is a wasteful number, since it uses less digits than its factorization.
300404011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7085.
The product of its (nonzero) digits is 48, while the sum is 13.
The square root of 300404011 is about 17332.1669447303. The cubic root of 300404011 is about 669.7333244792.
Adding to 300404011 its reverse (110404003), we get a palindrome (410808014).
The spelling of 300404011 in words is "three hundred million, four hundred four thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •