Base | Representation |
---|---|
bin | 1111111111000… |
… | …11111111011001 |
3 | 100100100010201211 |
4 | 13333203333121 |
5 | 233312244001 |
6 | 21150143121 |
7 | 3215566564 |
oct | 777437731 |
9 | 310303654 |
10 | 134103001 |
11 | 6977462a |
12 | 38ab1aa1 |
13 | 21a241b6 |
14 | 13b4b4db |
15 | bb8e351 |
hex | 7fe3fd9 |
134103001 has 2 divisors, whose sum is σ = 134103002. Its totient is φ = 134103000.
The previous prime is 134102999. The next prime is 134103029. The reversal of 134103001 is 100301431.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 134003776 + 99225 = 11576^2 + 315^2 .
It is a cyclic number.
It is not a de Polignac number, because 134103001 - 21 = 134102999 is a prime.
It is a super-2 number, since 2×1341030012 = 35967229754412002, which contains 22 as substring.
Together with 134102999, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (134103031) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 67051500 + 67051501.
It is an arithmetic number, because the mean of its divisors is an integer number (67051501).
Almost surely, 2134103001 is an apocalyptic number.
It is an amenable number.
134103001 is a deficient number, since it is larger than the sum of its proper divisors (1).
134103001 is an equidigital number, since it uses as much as digits as its factorization.
134103001 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 36, while the sum is 13.
The square root of 134103001 is about 11580.2850137637. The cubic root of 134103001 is about 511.8540754898.
Adding to 134103001 its reverse (100301431), we get a palindrome (234404432).
It can be divided in two parts, 13 and 4103001, that added together give a palindrome (4103014).
The spelling of 134103001 in words is "one hundred thirty-four million, one hundred three thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •