Base | Representation |
---|---|
bin | 111110101100000010… |
… | …0110011111111000101 |
3 | 110212111000101000112102 |
4 | 1331120010303333011 |
5 | 4201201120031233 |
6 | 141502213001445 |
7 | 12504023040206 |
oct | 1753004637705 |
9 | 425430330472 |
10 | 134621642693 |
11 | 5210245374a |
12 | 22110623285 |
13 | c90552bb55 |
14 | 67311db5ad |
15 | 377d97e1e8 |
hex | 1f58133fc5 |
134621642693 has 2 divisors, whose sum is σ = 134621642694. Its totient is φ = 134621642692.
The previous prime is 134621642681. The next prime is 134621642713. The reversal of 134621642693 is 396246126431.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 117705258724 + 16916383969 = 343082^2 + 130063^2 .
It is a cyclic number.
It is not a de Polignac number, because 134621642693 - 214 = 134621626309 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (134621642633) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 67310821346 + 67310821347.
It is an arithmetic number, because the mean of its divisors is an integer number (67310821347).
Almost surely, 2134621642693 is an apocalyptic number.
It is an amenable number.
134621642693 is a deficient number, since it is larger than the sum of its proper divisors (1).
134621642693 is an equidigital number, since it uses as much as digits as its factorization.
134621642693 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 1119744, while the sum is 47.
The spelling of 134621642693 in words is "one hundred thirty-four billion, six hundred twenty-one million, six hundred forty-two thousand, six hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •