Base | Representation |
---|---|
bin | 111111110110111101… |
… | …0111011111001100000 |
3 | 111002222012220010010000 |
4 | 1333231322323321200 |
5 | 4221323210323224 |
6 | 142555500340000 |
7 | 12623230450020 |
oct | 1775572737140 |
9 | 432865803100 |
10 | 137135636064 |
11 | 53182545119 |
12 | 226b2544600 |
13 | cc1631a6ab |
14 | 68cd051a80 |
15 | 38795210c9 |
hex | 1fedebbe60 |
137135636064 has 240 divisors, whose sum is σ = 485188704000. Its totient is φ = 37119326976.
The previous prime is 137135636059. The next prime is 137135636093. The reversal of 137135636064 is 460636531731.
137135636064 is a `hidden beast` number, since 1 + 3 + 7 + 1 + 3 + 5 + 636 + 0 + 6 + 4 = 666.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 39 ways as a sum of consecutive naturals, for example, 145837 + ... + 543635.
It is an arithmetic number, because the mean of its divisors is an integer number (2021619600).
Almost surely, 2137135636064 is an apocalyptic number.
137135636064 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 137135636064, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (242594352000).
137135636064 is an abundant number, since it is smaller than the sum of its proper divisors (348053067936).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
137135636064 is a wasteful number, since it uses less digits than its factorization.
137135636064 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 397847 (or 397830 counting only the distinct ones).
The product of its (nonzero) digits is 816480, while the sum is 45.
The spelling of 137135636064 in words is "one hundred thirty-seven billion, one hundred thirty-five million, six hundred thirty-six thousand, sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •