Base | Representation |
---|---|
bin | 10001111000111… |
… | …010001011001101 |
3 | 202220202020100202 |
4 | 101320322023031 |
5 | 1103313143041 |
6 | 45440503245 |
7 | 10303033361 |
oct | 2170721315 |
9 | 686666322 |
10 | 300131021 |
11 | 144463973 |
12 | 8461ab25 |
13 | 4a245628 |
14 | 2bc092a1 |
15 | 1b537a9b |
hex | 11e3a2cd |
300131021 has 2 divisors, whose sum is σ = 300131022. Its totient is φ = 300131020.
The previous prime is 300130981. The next prime is 300131059. The reversal of 300131021 is 120131003.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 281769796 + 18361225 = 16786^2 + 4285^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-300131021 is a prime.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 300130993 and 300131011.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (300131081) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 150065510 + 150065511.
It is an arithmetic number, because the mean of its divisors is an integer number (150065511).
Almost surely, 2300131021 is an apocalyptic number.
It is an amenable number.
300131021 is a deficient number, since it is larger than the sum of its proper divisors (1).
300131021 is an equidigital number, since it uses as much as digits as its factorization.
300131021 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 18, while the sum is 11.
The square root of 300131021 is about 17324.2899132980. The cubic root of 300131021 is about 669.5303912032.
Subtracting from 300131021 its product of nonzero digits (18), we obtain a palindrome (300131003).
Adding to 300131021 its reverse (120131003), we get a palindrome (420262024).
The spelling of 300131021 in words is "three hundred million, one hundred thirty-one thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •