Base | Representation |
---|---|
bin | 111110100010100100… |
… | …1000110100010001101 |
3 | 110211122212200002212110 |
4 | 1331011021012202031 |
5 | 4200023311001031 |
6 | 141410504454233 |
7 | 12463115110503 |
oct | 1750511064215 |
9 | 424585602773 |
10 | 134304000141 |
11 | 51a5a11a143 |
12 | 2204217a379 |
13 | c88479498c |
14 | 6700d54673 |
15 | 3760b37c46 |
hex | 1f4524688d |
134304000141 has 4 divisors (see below), whose sum is σ = 179072000192. Its totient is φ = 89536000092.
The previous prime is 134304000121. The next prime is 134304000143. The reversal of 134304000141 is 141000403431.
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 not a de Polignac number, because 134304000141 - 25 = 134304000109 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (134304000143) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 22384000021 + ... + 22384000026.
It is an arithmetic number, because the mean of its divisors is an integer number (44768000048).
Almost surely, 2134304000141 is an apocalyptic number.
It is an amenable number.
134304000141 is a deficient number, since it is larger than the sum of its proper divisors (44768000051).
134304000141 is an equidigital number, since it uses as much as digits as its factorization.
134304000141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 44768000050.
The product of its (nonzero) digits is 576, while the sum is 21.
Adding to 134304000141 its reverse (141000403431), we get a palindrome (275304403572).
The spelling of 134304000141 in words is "one hundred thirty-four billion, three hundred four million, one hundred forty-one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •