Base | Representation |
---|---|
bin | 111110100101011101… |
… | …1100101011011001101 |
3 | 110211220122102022012101 |
4 | 1331022323211123031 |
5 | 4200223141314244 |
6 | 141424254235101 |
7 | 12465404445565 |
oct | 1751273453315 |
9 | 424818368171 |
10 | 134401119949 |
11 | 51aa9a23748 |
12 | 2206a7b5a91 |
13 | c89b93a515 |
14 | 670dbd5da5 |
15 | 376941e0d4 |
hex | 1f4aee56cd |
134401119949 has 2 divisors, whose sum is σ = 134401119950. Its totient is φ = 134401119948.
The previous prime is 134401119929. The next prime is 134401119997. The reversal of 134401119949 is 949911104431.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 83333255625 + 51067864324 = 288675^2 + 225982^2 .
It is a cyclic number.
It is not a de Polignac number, because 134401119949 - 211 = 134401117901 is a prime.
It is a super-2 number, since 2×1344011199492 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 134401119899 and 134401119908.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (134401119929) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 67200559974 + 67200559975.
It is an arithmetic number, because the mean of its divisors is an integer number (67200559975).
Almost surely, 2134401119949 is an apocalyptic number.
It is an amenable number.
134401119949 is a deficient number, since it is larger than the sum of its proper divisors (1).
134401119949 is an equidigital number, since it uses as much as digits as its factorization.
134401119949 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 139968, while the sum is 46.
The spelling of 134401119949 in words is "one hundred thirty-four billion, four hundred one million, one hundred nineteen thousand, nine hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •