Base | Representation |
---|---|
bin | 10001111101110… |
… | …100111001100011 |
3 | 210000011201200120 |
4 | 101331310321203 |
5 | 1104130421011 |
6 | 45524251323 |
7 | 10320012615 |
oct | 2175647143 |
9 | 700151616 |
10 | 301420131 |
11 | 145164451 |
12 | 84b40b43 |
13 | 4a5a730c |
14 | 2c062db5 |
15 | 1b6dea06 |
hex | 11f74e63 |
301420131 has 8 divisors (see below), whose sum is σ = 402564624. Its totient is φ = 200611200.
The previous prime is 301420109. The next prime is 301420157. The reversal of 301420131 is 131024103.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 301420131 - 217 = 301289059 is a prime.
It is a super-2 number, since 2×3014201312 = 181708190744114322, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 301420131.
It is not an unprimeable number, because it can be changed into a prime (301420331) 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, 81786 + ... + 85391.
It is an arithmetic number, because the mean of its divisors is an integer number (50320578).
Almost surely, 2301420131 is an apocalyptic number.
301420131 is a deficient number, since it is larger than the sum of its proper divisors (101144493).
301420131 is a wasteful number, since it uses less digits than its factorization.
301420131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 167781.
The product of its (nonzero) digits is 72, while the sum is 15.
The square root of 301420131 is about 17361.4553249432. The cubic root of 301420131 is about 670.4876015415.
Adding to 301420131 its reverse (131024103), we get a palindrome (432444234).
The spelling of 301420131 in words is "three hundred one million, four hundred twenty thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.095 sec. • engine limits •