Base | Representation |
---|---|
bin | 111110011001111001… |
… | …1011101110001110001 |
3 | 110210220121022122011102 |
4 | 1330303303131301301 |
5 | 4143424324144010 |
6 | 141321554054145 |
7 | 12452653454363 |
oct | 1746363356161 |
9 | 423817278142 |
10 | 134013115505 |
11 | 5191aa01215 |
12 | 21b8087a355 |
13 | c839438ba9 |
14 | 66b4474d33 |
15 | 3745329ba5 |
hex | 1f33cddc71 |
134013115505 has 4 divisors (see below), whose sum is σ = 160815738612. Its totient is φ = 107210492400.
The previous prime is 134013115421. The next prime is 134013115507. The reversal of 134013115505 is 505511310431.
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 98474833249 + 35538282256 = 313807^2 + 188516^2 .
It is not a de Polignac number, because 134013115505 - 210 = 134013114481 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (134013115507) 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 in 3 ways as a sum of consecutive naturals, for example, 13401311546 + ... + 13401311555.
It is an arithmetic number, because the mean of its divisors is an integer number (40203934653).
Almost surely, 2134013115505 is an apocalyptic number.
It is an amenable number.
134013115505 is a deficient number, since it is larger than the sum of its proper divisors (26802623107).
134013115505 is an equidigital number, since it uses as much as digits as its factorization.
134013115505 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26802623106.
The product of its (nonzero) digits is 4500, while the sum is 29.
Adding to 134013115505 its reverse (505511310431), we get a palindrome (639524425936).
The spelling of 134013115505 in words is "one hundred thirty-four billion, thirteen million, one hundred fifteen thousand, five hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •