Base | Representation |
---|---|
bin | 10001111001101… |
… | …011010001011001 |
3 | 202221010110012220 |
4 | 101321223101121 |
5 | 1103341111441 |
6 | 45445054253 |
7 | 10304531565 |
oct | 2171532131 |
9 | 687113186 |
10 | 300332121 |
11 | 144590a71 |
12 | 846b7389 |
13 | 4a2b601b |
14 | 2bc5c6a5 |
15 | 1b577466 |
hex | 11e6b459 |
300332121 has 4 divisors (see below), whose sum is σ = 400442832. Its totient is φ = 200221412.
The previous prime is 300332117. The next prime is 300332129. The reversal of 300332121 is 121233003.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 121233003 = 3 ⋅40411001.
It is a cyclic number.
It is not a de Polignac number, because 300332121 - 22 = 300332117 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 300332121.
It is not an unprimeable number, because it can be changed into a prime (300332129) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 50055351 + ... + 50055356.
It is an arithmetic number, because the mean of its divisors is an integer number (100110708).
Almost surely, 2300332121 is an apocalyptic number.
It is an amenable number.
300332121 is a deficient number, since it is larger than the sum of its proper divisors (100110711).
300332121 is a wasteful number, since it uses less digits than its factorization.
300332121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 100110710.
The product of its (nonzero) digits is 108, while the sum is 15.
The square root of 300332121 is about 17330.0929310838. The cubic root of 300332121 is about 669.6798953547.
Adding to 300332121 its reverse (121233003), we get a palindrome (421565124).
The spelling of 300332121 in words is "three hundred million, three hundred thirty-two thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •