Base | Representation |
---|---|
bin | 11110100101100010101011… |
… | …011000111100010110100001 |
3 | 122122022002212021201010212211 |
4 | 132211202223120330112201 |
5 | 120112444010243401223 |
6 | 1154034113141122121 |
7 | 40222561002336403 |
oct | 3645425330742641 |
9 | 578262767633784 |
10 | 134521251153313 |
11 | 39954162350312 |
12 | 131071529b9341 |
13 | 5a0a3b816aacb |
14 | 2530c12c50b73 |
15 | 1084316b94d0d |
hex | 7a58ab63c5a1 |
134521251153313 has 4 divisors (see below), whose sum is σ = 134611594506820. Its totient is φ = 134430907799808.
The previous prime is 134521251153227. The next prime is 134521251153337. The reversal of 134521251153313 is 313351152125431.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 73043294692369 + 61477956460944 = 8546537^2 + 7840788^2 .
It is a cyclic number.
It is not a de Polignac number, because 134521251153313 - 225 = 134521217598881 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (134521251153343) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 45171674520 + ... + 45171677497.
It is an arithmetic number, because the mean of its divisors is an integer number (33652898626705).
Almost surely, 2134521251153313 is an apocalyptic number.
It is an amenable number.
134521251153313 is a deficient number, since it is larger than the sum of its proper divisors (90343353507).
134521251153313 is an equidigital number, since it uses as much as digits as its factorization.
134521251153313 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 90343353506.
The product of its digits is 162000, while the sum is 40.
The spelling of 134521251153313 in words is "one hundred thirty-four trillion, five hundred twenty-one billion, two hundred fifty-one million, one hundred fifty-three thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •