Base | Representation |
---|---|
bin | 111110011011001101… |
… | …0011110100110111111 |
3 | 110211000122200222000202 |
4 | 1330312122132212333 |
5 | 4144022031200314 |
6 | 141330200314115 |
7 | 12454024552166 |
oct | 1746632364677 |
9 | 424018628022 |
10 | 134056896959 |
11 | 51942694937 |
12 | 21b9347293b |
13 | c84552798b |
14 | 66ba1d03dd |
15 | 37490c70de |
hex | 1f3669e9bf |
134056896959 has 2 divisors, whose sum is σ = 134056896960. Its totient is φ = 134056896958.
The previous prime is 134056896931. The next prime is 134056897031. The reversal of 134056896959 is 959698650431.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 134056896959 - 28 = 134056896703 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 134056896895 and 134056896904.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (134056896929) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 67028448479 + 67028448480.
It is an arithmetic number, because the mean of its divisors is an integer number (67028448480).
Almost surely, 2134056896959 is an apocalyptic number.
134056896959 is a deficient number, since it is larger than the sum of its proper divisors (1).
134056896959 is an equidigital number, since it uses as much as digits as its factorization.
134056896959 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 62985600, while the sum is 65.
The spelling of 134056896959 in words is "one hundred thirty-four billion, fifty-six million, eight hundred ninety-six thousand, nine hundred fifty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •