Base | Representation |
---|---|
bin | 1000000001110101011… |
… | …1101100011100000000 |
3 | 111012000200211120010000 |
4 | 2000131113230130000 |
5 | 4224441004012224 |
6 | 143210455040000 |
7 | 12652035066000 |
oct | 2003527543400 |
9 | 435020746100 |
10 | 137931704064 |
11 | 5355093a860 |
12 | 22895070000 |
13 | 1001222494b |
14 | 6966a76000 |
15 | 38c436d0c9 |
hex | 201d5ec700 |
137931704064 has 1440 divisors, whose sum is σ = 548465702400. Its totient is φ = 34139750400.
The previous prime is 137931704039. The next prime is 137931704093. The reversal of 137931704064 is 460407139731.
137931704064 is a `hidden beast` number, since 1 + 3 + 79 + 3 + 170 + 406 + 4 = 666.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 159 ways as a sum of consecutive naturals, for example, 3207714027 + ... + 3207714069.
It is an arithmetic number, because the mean of its divisors is an integer number (380878960).
Almost surely, 2137931704064 is an apocalyptic number.
137931704064 is a gapful number since it is divisible by the number (14) 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 137931704064, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (274232851200).
137931704064 is an abundant number, since it is smaller than the sum of its proper divisors (410533998336).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
137931704064 is an equidigital number, since it uses as much as digits as its factorization.
137931704064 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 144 (or 107 counting only the distinct ones).
The product of its (nonzero) digits is 381024, while the sum is 45.
The spelling of 137931704064 in words is "one hundred thirty-seven billion, nine hundred thirty-one million, seven hundred four thousand, sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •