Base | Representation |
---|---|
bin | 10000000011000… |
… | …10000010000101 |
3 | 100101022100220212 |
4 | 20001202002011 |
5 | 233430304034 |
6 | 21205205205 |
7 | 3223150001 |
oct | 1001420205 |
9 | 311270825 |
10 | 134619269 |
11 | 69a974a4 |
12 | 39100805 |
13 | 21b75195 |
14 | 13c43701 |
15 | bc422ce |
hex | 8062085 |
134619269 has 2 divisors, whose sum is σ = 134619270. Its totient is φ = 134619268.
The previous prime is 134619263. The next prime is 134619271. The reversal of 134619269 is 962916431.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 134212225 + 407044 = 11585^2 + 638^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-134619269 is a prime.
It is a super-2 number, since 2×1346192692 = 36244695172188722, which contains 22 as substring.
It is a Sophie Germain prime.
Together with 134619271, it forms a pair of twin primes.
It is a Chen prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (134619263) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (7) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 67309634 + 67309635.
It is an arithmetic number, because the mean of its divisors is an integer number (67309635).
Almost surely, 2134619269 is an apocalyptic number.
It is an amenable number.
134619269 is a deficient number, since it is larger than the sum of its proper divisors (1).
134619269 is an equidigital number, since it uses as much as digits as its factorization.
134619269 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 69984, while the sum is 41.
The square root of 134619269 is about 11602.5544170239. The cubic root of 134619269 is about 512.5100774540.
The spelling of 134619269 in words is "one hundred thirty-four million, six hundred nineteen thousand, two hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •