Base | Representation |
---|---|
bin | 10001111101110… |
… | …101101000100101 |
3 | 210000011212211001 |
4 | 101331311220211 |
5 | 1104131020031 |
6 | 45524313301 |
7 | 10320024445 |
oct | 2175655045 |
9 | 700155731 |
10 | 301423141 |
11 | 145166738 |
12 | 84b42831 |
13 | 4a5a87b6 |
14 | 2c064125 |
15 | 1b6e0861 |
hex | 11f75a25 |
301423141 has 4 divisors (see below), whose sum is σ = 319153932. Its totient is φ = 283692352.
The previous prime is 301423121. The next prime is 301423159. The reversal of 301423141 is 141324103.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 141324103 = 11867 ⋅11909.
It can be written as a sum of positive squares in 2 ways, for example, as 181980100 + 119443041 = 13490^2 + 10929^2 .
It is a cyclic number.
It is not a de Polignac number, because 301423141 - 225 = 267868709 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (301423121) 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, 8865370 + ... + 8865403.
It is an arithmetic number, because the mean of its divisors is an integer number (79788483).
Almost surely, 2301423141 is an apocalyptic number.
It is an amenable number.
301423141 is a deficient number, since it is larger than the sum of its proper divisors (17730791).
301423141 is a wasteful number, since it uses less digits than its factorization.
301423141 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 17730790.
The product of its (nonzero) digits is 288, while the sum is 19.
The square root of 301423141 is about 17361.5420110081. The cubic root of 301423141 is about 670.4898333776.
Adding to 301423141 its reverse (141324103), we get a palindrome (442747244).
The spelling of 301423141 in words is "three hundred one million, four hundred twenty-three thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •