Base | Representation |
---|---|
bin | 111110100110101110… |
… | …0111010001011010100 |
3 | 110212000120222212102110 |
4 | 1331031130322023110 |
5 | 4200320003111012 |
6 | 141432404511020 |
7 | 12466430062563 |
oct | 1751534721324 |
9 | 425016885373 |
10 | 134443410132 |
11 | 52020888a09 |
12 | 220809ab470 |
13 | c8a76265b5 |
14 | 6715683bda |
15 | 376cec473c |
hex | 1f4d73a2d4 |
134443410132 has 12 divisors (see below), whose sum is σ = 313701290336. Its totient is φ = 44814470040.
The previous prime is 134443410131. The next prime is 134443410137. The reversal of 134443410132 is 231014344431.
It is a tau number, because it is divible by the number of its divisors (12).
It is a self number, because there is not a number n which added to its sum of digits gives 134443410132.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (134443410131) 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, 5601808744 + ... + 5601808767.
Almost surely, 2134443410132 is an apocalyptic number.
134443410132 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
134443410132 is an abundant number, since it is smaller than the sum of its proper divisors (179257880204).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
134443410132 is a wasteful number, since it uses less digits than its factorization.
134443410132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11203617518 (or 11203617516 counting only the distinct ones).
The product of its (nonzero) digits is 13824, while the sum is 30.
Adding to 134443410132 its reverse (231014344431), we get a palindrome (365457754563).
The spelling of 134443410132 in words is "one hundred thirty-four billion, four hundred forty-three million, four hundred ten thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •