Base | Representation |
---|---|
bin | 111111110110101111… |
… | …1101111100000000000 |
3 | 111002221201110221102010 |
4 | 1333231133233200000 |
5 | 4221314344214032 |
6 | 142555043452520 |
7 | 12623113036512 |
oct | 1775537574000 |
9 | 432851427363 |
10 | 137128507392 |
11 | 53179516258 |
12 | 226b0087140 |
13 | cc149c2a46 |
14 | 68cc117bb2 |
15 | 3878ab3ccc |
hex | 1fed7ef800 |
137128507392 has 96 divisors (see below), whose sum is σ = 370595993040. Its totient is φ = 45083197440.
The previous prime is 137128507387. The next prime is 137128507489. The reversal of 137128507392 is 293705821731.
It is a tau number, because it is divible by the number of its divisors (96).
It is a Harshad number since it is a multiple of its sum of digits (48).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 295642 + ... + 601382.
Almost surely, 2137128507392 is an apocalyptic number.
137128507392 is a gapful number since it is divisible by the number (12) 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 137128507392, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (185297996520).
137128507392 is an abundant number, since it is smaller than the sum of its proper divisors (233467485648).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
137128507392 is an equidigital number, since it uses as much as digits as its factorization.
137128507392 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 305839 (or 305819 counting only the distinct ones).
The product of its (nonzero) digits is 635040, while the sum is 48.
The spelling of 137128507392 in words is "one hundred thirty-seven billion, one hundred twenty-eight million, five hundred seven thousand, three hundred ninety-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •