Base | Representation |
---|---|
bin | 111110100100010001… |
… | …1110001111000000000 |
3 | 110211210212112111212110 |
4 | 1331020203301320000 |
5 | 4200132444400211 |
6 | 141420313255320 |
7 | 12464412263520 |
oct | 1751043617000 |
9 | 424725474773 |
10 | 134361325056 |
11 | 51a89513202 |
12 | 22059404540 |
13 | c89361614a |
14 | 67087d7680 |
15 | 3765bacea6 |
hex | 1f488f1e00 |
134361325056 has 160 divisors (see below), whose sum is σ = 409668779520. Its totient is φ = 38333915136.
The previous prime is 134361325027. The next prime is 134361325061. The reversal of 134361325056 is 650523163431.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 7808110 + ... + 7825298.
It is an arithmetic number, because the mean of its divisors is an integer number (2560429872).
Almost surely, 2134361325056 is an apocalyptic number.
134361325056 is a gapful number since it is divisible by the number (16) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 134361325056, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (204834389760).
134361325056 is an abundant number, since it is smaller than the sum of its proper divisors (275307454464).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
134361325056 is an equidigital number, since it uses as much as digits as its factorization.
134361325056 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 17944 (or 17928 counting only the distinct ones).
The product of its (nonzero) digits is 194400, while the sum is 39.
Adding to 134361325056 its reverse (650523163431), we get a palindrome (784884488487).
The spelling of 134361325056 in words is "one hundred thirty-four billion, three hundred sixty-one million, three hundred twenty-five thousand, fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •