Base | Representation |
---|---|
bin | 10001111100101… |
… | …110010100000101 |
3 | 202222122001002111 |
4 | 101330232110011 |
5 | 1104042143023 |
6 | 45514141021 |
7 | 10314366661 |
oct | 2174562405 |
9 | 688561074 |
10 | 301131013 |
11 | 144a87207 |
12 | 84a21771 |
13 | 4a505841 |
14 | 2bdc98a1 |
15 | 1b68400d |
hex | 11f2e505 |
301131013 has 4 divisors (see below), whose sum is σ = 318844620. Its totient is φ = 283417408.
The previous prime is 301131011. The next prime is 301131023. The reversal of 301131013 is 310131103.
It is a happy number.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 172580769 + 128550244 = 13137^2 + 11338^2 .
It is a cyclic number.
It is not a de Polignac number, because 301131013 - 21 = 301131011 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 301130984 and 301131002.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (301131011) 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, 8856778 + ... + 8856811.
It is an arithmetic number, because the mean of its divisors is an integer number (79711155).
Almost surely, 2301131013 is an apocalyptic number.
It is an amenable number.
301131013 is a deficient number, since it is larger than the sum of its proper divisors (17713607).
301131013 is a wasteful number, since it uses less digits than its factorization.
301131013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 17713606.
The product of its (nonzero) digits is 27, while the sum is 13.
The square root of 301131013 is about 17353.1268940211. The cubic root of 301131013 is about 670.2731588342.
Adding to 301131013 its reverse (310131103), we get a palindrome (611262116).
The spelling of 301131013 in words is "three hundred one million, one hundred thirty-one thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •