Base | Representation |
---|---|
bin | 11110100010100010101110… |
… | …110111101000111010010111 |
3 | 122121120101212211002201112212 |
4 | 132202202232313220322113 |
5 | 120101104412140222331 |
6 | 1153355310101504035 |
7 | 40201643440655135 |
oct | 3642425667507227 |
9 | 577511784081485 |
10 | 134315151101591 |
11 | 39884810231a59 |
12 | 1309321441201b |
13 | 59c3b31121995 |
14 | 2524c60958755 |
15 | 107dca2e22d2b |
hex | 7a28aede8e97 |
134315151101591 has 2 divisors, whose sum is σ = 134315151101592. Its totient is φ = 134315151101590.
The previous prime is 134315151101563. The next prime is 134315151101611. The reversal of 134315151101591 is 195101151513431.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-134315151101591 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (134315150101591) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 67157575550795 + 67157575550796.
It is an arithmetic number, because the mean of its divisors is an integer number (67157575550796).
Almost surely, 2134315151101591 is an apocalyptic number.
134315151101591 is a deficient number, since it is larger than the sum of its proper divisors (1).
134315151101591 is an equidigital number, since it uses as much as digits as its factorization.
134315151101591 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 40500, while the sum is 41.
The spelling of 134315151101591 in words is "one hundred thirty-four trillion, three hundred fifteen billion, one hundred fifty-one million, one hundred one thousand, five hundred ninety-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •