Base | Representation |
---|---|
bin | 111110100110111111… |
… | …0111011111010011101 |
3 | 110212001012210001101011 |
4 | 1331031332323322131 |
5 | 4200324244031031 |
6 | 141433324015221 |
7 | 12466565643463 |
oct | 1751576737235 |
9 | 425035701334 |
10 | 134452330141 |
11 | 52025920718 |
12 | 22083991511 |
13 | c8a942a6cc |
14 | 6716926833 |
15 | 376db876b1 |
hex | 1f4dfbbe9d |
134452330141 has 4 divisors (see below), whose sum is σ = 134818685632. Its totient is φ = 134085974652.
The previous prime is 134452330097. The next prime is 134452330153. The reversal of 134452330141 is 141033254431.
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, and also an emirpimes, since its reverse is a distinct semiprime: 141033254431 = 181 ⋅779189251.
It is a cyclic number.
It is not a de Polignac number, because 134452330141 - 211 = 134452328093 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 (134452330541) 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, 183177195 + ... + 183177928.
It is an arithmetic number, because the mean of its divisors is an integer number (33704671408).
Almost surely, 2134452330141 is an apocalyptic number.
It is an amenable number.
134452330141 is a deficient number, since it is larger than the sum of its proper divisors (366355491).
134452330141 is an equidigital number, since it uses as much as digits as its factorization.
134452330141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 366355490.
The product of its (nonzero) digits is 17280, while the sum is 31.
Adding to 134452330141 its reverse (141033254431), we get a palindrome (275485584572).
The spelling of 134452330141 in words is "one hundred thirty-four billion, four hundred fifty-two million, three hundred thirty thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •