Base | Representation |
---|---|
bin | 10000000001011… |
… | …11110010001011 |
3 | 100100220220120222 |
4 | 20000233302023 |
5 | 233402212301 |
6 | 21200540255 |
7 | 3221331644 |
oct | 1000576213 |
9 | 310826528 |
10 | 134413451 |
11 | 699668a7 |
12 | 3902168b |
13 | 21b025b3 |
14 | 13bcc6cb |
15 | bc0131b |
hex | 802fc8b |
134413451 has 2 divisors, whose sum is σ = 134413452. Its totient is φ = 134413450.
The previous prime is 134413423. The next prime is 134413453. The reversal of 134413451 is 154314431.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-134413451 is a prime.
It is a super-3 number, since 3×1344134513 (a number of 25 digits) contains 333 as substring.
Together with 134413453, it forms a pair of twin primes.
It is a Chen prime.
It is equal to p7614044 and since 134413451 and 7614044 have the same sum of digits, it is a Honaker prime.
It is a self number, because there is not a number n which added to its sum of digits gives 134413451.
It is not a weakly prime, because it can be changed into another prime (134413453) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 67206725 + 67206726.
It is an arithmetic number, because the mean of its divisors is an integer number (67206726).
Almost surely, 2134413451 is an apocalyptic number.
134413451 is a deficient number, since it is larger than the sum of its proper divisors (1).
134413451 is an equidigital number, since it uses as much as digits as its factorization.
134413451 is an evil number, because the sum of its binary digits is even.
The product of its digits is 2880, while the sum is 26.
The square root of 134413451 is about 11593.6815119271. The cubic root of 134413451 is about 512.2487537884.
Adding to 134413451 its reverse (154314431), we get a palindrome (288727882).
The spelling of 134413451 in words is "one hundred thirty-four million, four hundred thirteen thousand, four hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •