Base | Representation |
---|---|
bin | 111110101100000001… |
… | …0111111001100111111 |
3 | 110212110222110201101001 |
4 | 1331120002333030333 |
5 | 4201201004224401 |
6 | 141502154431131 |
7 | 12504016005502 |
oct | 1753002771477 |
9 | 425428421331 |
10 | 134621164351 |
11 | 52102157323 |
12 | 221104324a7 |
13 | c9053c21cb |
14 | 6731115139 |
15 | 377d8d7601 |
hex | 1f580bf33f |
134621164351 has 2 divisors, whose sum is σ = 134621164352. Its totient is φ = 134621164350.
The previous prime is 134621164283. The next prime is 134621164411. The reversal of 134621164351 is 153461126431.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-134621164351 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 134621164351.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (134621165351) 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, 67310582175 + 67310582176.
It is an arithmetic number, because the mean of its divisors is an integer number (67310582176).
Almost surely, 2134621164351 is an apocalyptic number.
134621164351 is a deficient number, since it is larger than the sum of its proper divisors (1).
134621164351 is an equidigital number, since it uses as much as digits as its factorization.
134621164351 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 51840, while the sum is 37.
The spelling of 134621164351 in words is "one hundred thirty-four billion, six hundred twenty-one million, one hundred sixty-four thousand, three hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •