Base | Representation |
---|---|
bin | 10100011001000… |
… | …001001111011001 |
3 | 212211201122002112 |
4 | 110121001033121 |
5 | 1200034244001 |
6 | 53540242105 |
7 | 11322553562 |
oct | 2431011731 |
9 | 784648075 |
10 | 342103001 |
11 | 166121059 |
12 | 966a0335 |
13 | 55b4c916 |
14 | 33613169 |
15 | 20078cbb |
hex | 146413d9 |
342103001 has 4 divisors (see below), whose sum is σ = 342210000. Its totient is φ = 341996004.
The previous prime is 342102997. The next prime is 342103031. The reversal of 342103001 is 100301243.
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 342103001 - 22 = 342102997 is a prime.
It is a super-3 number, since 3×3421030013 (a number of 27 digits) contains 333 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (342103031) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 48551 + ... + 55148.
It is an arithmetic number, because the mean of its divisors is an integer number (85552500).
Almost surely, 2342103001 is an apocalyptic number.
It is an amenable number.
342103001 is a deficient number, since it is larger than the sum of its proper divisors (106999).
342103001 is a wasteful number, since it uses less digits than its factorization.
342103001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 106998.
The product of its (nonzero) digits is 72, while the sum is 14.
The square root of 342103001 is about 18496.0266273597. The cubic root of 342103001 is about 699.3892638985.
Adding to 342103001 its reverse (100301243), we get a palindrome (442404244).
The spelling of 342103001 in words is "three hundred forty-two million, one hundred three thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •