Base | Representation |
---|---|
bin | 11110100101010000010100… |
… | …000000001101100110100101 |
3 | 122122020012221222120222211202 |
4 | 132211100110000031212211 |
5 | 120112133114022112243 |
6 | 1154021052303212245 |
7 | 40221262222503422 |
oct | 3645202400154645 |
9 | 578205858528752 |
10 | 134501531441573 |
11 | 39946863061a8a |
12 | 1310336a8a7085 |
13 | 5a0859487bb1a |
14 | 252dca1c8ad49 |
15 | 1083a608424b8 |
hex | 7a541400d9a5 |
134501531441573 has 2 divisors, whose sum is σ = 134501531441574. Its totient is φ = 134501531441572.
The previous prime is 134501531441561. The next prime is 134501531441623. The reversal of 134501531441573 is 375144135105431.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 132817718967649 + 1683812473924 = 11524657^2 + 1297618^2 .
It is a cyclic number.
It is not a de Polignac number, because 134501531441573 - 212 = 134501531437477 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (134501531441503) 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, 67250765720786 + 67250765720787.
It is an arithmetic number, because the mean of its divisors is an integer number (67250765720787).
Almost surely, 2134501531441573 is an apocalyptic number.
It is an amenable number.
134501531441573 is a deficient number, since it is larger than the sum of its proper divisors (1).
134501531441573 is an equidigital number, since it uses as much as digits as its factorization.
134501531441573 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1512000, while the sum is 47.
The spelling of 134501531441573 in words is "one hundred thirty-four trillion, five hundred one billion, five hundred thirty-one million, four hundred forty-one thousand, five hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •