Base | Representation |
---|---|
bin | 111110101000000011… |
… | …0111111000000000000 |
3 | 110212010200212222111110 |
4 | 1331100012333000000 |
5 | 4200412411304433 |
6 | 141441040243320 |
7 | 12500511043020 |
oct | 1752006770000 |
9 | 425120788443 |
10 | 134487994368 |
11 | 52043a6a792 |
12 | 22093910540 |
13 | c8b39368c0 |
14 | 671b56ba80 |
15 | 3771d7e963 |
hex | 1f501bf000 |
134487994368 has 416 divisors, whose sum is σ = 451767855616. Its totient is φ = 34632105984.
The previous prime is 134487994357. The next prime is 134487994379. The reversal of 134487994368 is 863499784431.
It is an interprime number because it is at equal distance from previous prime (134487994357) and next prime (134487994379).
It is a tau number, because it is divible by the number of its divisors (416).
It is a junction number, because it is equal to n+sod(n) for n = 134487994299 and 134487994308.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 48081546 + ... + 48084342.
Almost surely, 2134487994368 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 134487994368, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (225883927808).
134487994368 is an abundant number, since it is smaller than the sum of its proper divisors (317279861248).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
134487994368 is a wasteful number, since it uses less digits than its factorization.
134487994368 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2887 (or 2865 counting only the distinct ones).
The product of its digits is 125411328, while the sum is 66.
The spelling of 134487994368 in words is "one hundred thirty-four billion, four hundred eighty-seven million, nine hundred ninety-four thousand, three hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •