Base | Representation |
---|---|
bin | 111110110011100000… |
… | …0110011010101000000 |
3 | 110220010110221011200002 |
4 | 1331213000303111000 |
5 | 4202204243442124 |
6 | 141543124215132 |
7 | 12513155130605 |
oct | 1754700632500 |
9 | 426113834602 |
10 | 134872249664 |
11 | 52220961449 |
12 | 2218053a4a8 |
13 | c9454248b9 |
14 | 67565d46ac |
15 | 37959830ae |
hex | 1f67033540 |
134872249664 has 56 divisors (see below), whose sum is σ = 281891171040. Its totient is φ = 63848784384.
The previous prime is 134872249663. The next prime is 134872249667. The reversal of 134872249664 is 466942278431.
It is a super-2 number, since 2×1348722496642 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (134872249663) 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 7 ways as a sum of consecutive naturals, for example, 2062982 + ... + 2127354.
Almost surely, 2134872249664 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 134872249664, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (140945585520).
134872249664 is an abundant number, since it is smaller than the sum of its proper divisors (147018921376).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
134872249664 is a wasteful number, since it uses less digits than its factorization.
134872249664 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 66127 (or 66117 counting only the distinct ones).
The product of its digits is 13934592, while the sum is 56.
The spelling of 134872249664 in words is "one hundred thirty-four billion, eight hundred seventy-two million, two hundred forty-nine thousand, six hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •