Base | Representation |
---|---|
bin | 111110011100100110… |
… | …1001111111010110001 |
3 | 110211010220212212210201 |
4 | 1330321031033322301 |
5 | 4144121030314221 |
6 | 141334552555201 |
7 | 12455134104601 |
oct | 1747115177261 |
9 | 424126785721 |
10 | 134103760561 |
11 | 51967093191 |
12 | 21ba70b2b01 |
13 | c852155614 |
14 | 66c250cc01 |
15 | 374d282891 |
hex | 1f3934feb1 |
134103760561 has 4 divisors (see below), whose sum is σ = 134453901312. Its totient is φ = 133753619812.
The previous prime is 134103760519. The next prime is 134103760607. The reversal of 134103760561 is 165067301431.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 134103760561 - 27 = 134103760433 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 134103760561.
It is not an unprimeable number, because it can be changed into a prime (134103770561) 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, 175069801 + ... + 175070566.
It is an arithmetic number, because the mean of its divisors is an integer number (33613475328).
Almost surely, 2134103760561 is an apocalyptic number.
It is an amenable number.
134103760561 is a deficient number, since it is larger than the sum of its proper divisors (350140751).
134103760561 is an equidigital number, since it uses as much as digits as its factorization.
134103760561 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 350140750.
The product of its (nonzero) digits is 45360, while the sum is 37.
The spelling of 134103760561 in words is "one hundred thirty-four billion, one hundred three million, seven hundred sixty thousand, five hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •