Base | Representation |
---|---|
bin | 10001111011011… |
… | …101110000000111 |
3 | 202222000021102221 |
4 | 101323131300013 |
5 | 1104001113111 |
6 | 45503113211 |
7 | 10311523636 |
oct | 2173356007 |
9 | 688007387 |
10 | 300801031 |
11 | 1448812a3 |
12 | 848a2807 |
13 | 4a41b59b |
14 | 2bd4151d |
15 | 1b61b371 |
hex | 11eddc07 |
300801031 has 2 divisors, whose sum is σ = 300801032. Its totient is φ = 300801030.
The previous prime is 300801013. The next prime is 300801071. The reversal of 300801031 is 130108003.
Together with previous prime (300801013) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It is an emirp because it is prime and its reverse (130108003) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 300801031 - 25 = 300800999 is a prime.
It is a super-2 number, since 2×3008010312 = 180962520501325922, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 300800996 and 300801014.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (300801071) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 150400515 + 150400516.
It is an arithmetic number, because the mean of its divisors is an integer number (150400516).
Almost surely, 2300801031 is an apocalyptic number.
300801031 is a deficient number, since it is larger than the sum of its proper divisors (1).
300801031 is an equidigital number, since it uses as much as digits as its factorization.
300801031 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 72, while the sum is 16.
The square root of 300801031 is about 17343.6164337199. The cubic root of 300801031 is about 670.0282389523.
Adding to 300801031 its reverse (130108003), we get a palindrome (430909034).
The spelling of 300801031 in words is "three hundred million, eight hundred one thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •