Base | Representation |
---|---|
bin | 10000000001101… |
… | …10110100001011 |
3 | 100100222101002122 |
4 | 20000312310023 |
5 | 233404123001 |
6 | 21201321455 |
7 | 3221511626 |
oct | 1000666413 |
9 | 310871078 |
10 | 134442251 |
11 | 699864a9 |
12 | 3903628b |
13 | 21b12738 |
14 | 13bd8dbd |
15 | bc09b1b |
hex | 8036d0b |
134442251 has 2 divisors, whose sum is σ = 134442252. Its totient is φ = 134442250.
The previous prime is 134442247. The next prime is 134442277. The reversal of 134442251 is 152244431.
It is an a-pointer prime, because the next prime (134442277) can be obtained adding 134442251 to its sum of digits (26).
It is a weak prime.
It is an emirp because it is prime and its reverse (152244431) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 134442251 - 22 = 134442247 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 134442251.
It is not a weakly prime, because it can be changed into another prime (134442221) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 67221125 + 67221126.
It is an arithmetic number, because the mean of its divisors is an integer number (67221126).
Almost surely, 2134442251 is an apocalyptic number.
134442251 is a deficient number, since it is larger than the sum of its proper divisors (1).
134442251 is an equidigital number, since it uses as much as digits as its factorization.
134442251 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 3840, while the sum is 26.
The square root of 134442251 is about 11594.9235012569. The cubic root of 134442251 is about 512.2853367109.
Adding to 134442251 its reverse (152244431), we get a palindrome (286686682).
The spelling of 134442251 in words is "one hundred thirty-four million, four hundred forty-two thousand, two hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •