Base | Representation |
---|---|
bin | 11111011011111111101 |
3 | 1221100002101 |
4 | 3323133331 |
5 | 230431031 |
6 | 34025101 |
7 | 11520220 |
oct | 3733775 |
9 | 1840071 |
10 | 1030141 |
11 | 643a62 |
12 | 418191 |
13 | 2a0b68 |
14 | 1cb5b7 |
15 | 155361 |
hex | fb7fd |
1030141 has 4 divisors (see below), whose sum is σ = 1177312. Its totient is φ = 882972.
The previous prime is 1030121. The next prime is 1030153. The reversal of 1030141 is 1410301.
It is a happy number.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 1030141 - 217 = 899069 is a prime.
It is a super-2 number, since 2×10301412 = 2122380959762, which contains 22 as substring.
It is an alternating number because its digits alternate between odd and even.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1030111) 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 3 ways as a sum of consecutive naturals, for example, 73575 + ... + 73588.
It is an arithmetic number, because the mean of its divisors is an integer number (294328).
21030141 is an apocalyptic number.
It is an amenable number.
1030141 is a deficient number, since it is larger than the sum of its proper divisors (147171).
1030141 is an equidigital number, since it uses as much as digits as its factorization.
1030141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 147170.
The product of its (nonzero) digits is 12, while the sum is 10.
The square root of 1030141 is about 1014.9586198461. The cubic root of 1030141 is about 100.9947714837.
Adding to 1030141 its reverse (1410301), we get a palindrome (2440442).
The spelling of 1030141 in words is "one million, thirty thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •