Base | Representation |
---|---|
bin | 11110100101100110101010… |
… | …001010011000001110110111 |
3 | 122122022111220011200202010021 |
4 | 132211212222022120032313 |
5 | 120113031234013303211 |
6 | 1154040101231510011 |
7 | 40223101634033605 |
oct | 3645465212301667 |
9 | 578274804622107 |
10 | 134525525525431 |
11 | 39955a560a4357 |
12 | 13107b46388307 |
13 | 5a0a919886391 |
14 | 25310da7c6875 |
15 | 10844b7065771 |
hex | 7a59aa2983b7 |
134525525525431 has 2 divisors, whose sum is σ = 134525525525432. Its totient is φ = 134525525525430.
The previous prime is 134525525525351. The next prime is 134525525525483.
134525525525431 is nontrivially palindromic in base 10.
It is an a-pointer prime, because the next prime (134525525525483) can be obtained adding 134525525525431 to its sum of digits (52).
It is a strong prime.
It is a palprime.
It is a cyclic number.
It is not a de Polignac number, because 134525525525431 - 215 = 134525525492663 is a prime.
It is a super-2 number, since 2×1345255255254312 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (134525525525491) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 67262762762715 + 67262762762716.
It is an arithmetic number, because the mean of its divisors is an integer number (67262762762716).
Almost surely, 2134525525525431 is an apocalyptic number.
134525525525431 is a deficient number, since it is larger than the sum of its proper divisors (1).
134525525525431 is an equidigital number, since it uses as much as digits as its factorization.
134525525525431 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 18000000, while the sum is 52.
The spelling of 134525525525431 in words is "one hundred thirty-four trillion, five hundred twenty-five billion, five hundred twenty-five million, five hundred twenty-five thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.099 sec. • engine limits •