Base | Representation |
---|---|
bin | 111110100100101110… |
… | …0000001101110100011 |
3 | 110211211220021122012101 |
4 | 1331021130001232203 |
5 | 4200200233220201 |
6 | 141422001311231 |
7 | 12464651515036 |
oct | 1751134015643 |
9 | 424756248171 |
10 | 134376070051 |
11 | 51a96874353 |
12 | 22062335517 |
13 | c8966a96b2 |
14 | 670a75501d |
15 | 3767121d01 |
hex | 1f49701ba3 |
134376070051 has 2 divisors, whose sum is σ = 134376070052. Its totient is φ = 134376070050.
The previous prime is 134376070013. The next prime is 134376070057. The reversal of 134376070051 is 150070673431.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 134376070051 - 211 = 134376068003 is a prime.
It is not a weakly prime, because it can be changed into another prime (134376070057) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 67188035025 + 67188035026.
It is an arithmetic number, because the mean of its divisors is an integer number (67188035026).
Almost surely, 2134376070051 is an apocalyptic number.
134376070051 is a deficient number, since it is larger than the sum of its proper divisors (1).
134376070051 is an equidigital number, since it uses as much as digits as its factorization.
134376070051 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 52920, while the sum is 37.
The spelling of 134376070051 in words is "one hundred thirty-four billion, three hundred seventy-six million, seventy thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •