Base | Representation |
---|---|
bin | 11111001010011001110001… |
… | …011101111110110100010000 |
3 | 122222021021010112000012210011 |
4 | 133022121301131332310100 |
5 | 120430444211341201430 |
6 | 1203253514133244304 |
7 | 40603563366205441 |
oct | 3712316135766420 |
9 | 588237115005704 |
10 | 137054310100240 |
11 | 3a740452064735 |
12 | 13456063193694 |
13 | 5b622208980b0 |
14 | 25bb66d31b2c8 |
15 | 10ca16cc1922a |
hex | 7ca67177ed10 |
137054310100240 has 80 divisors (see below), whose sum is σ = 343164959661888. Its totient is φ = 50604365680128.
The previous prime is 137054310100207. The next prime is 137054310100259. The reversal of 137054310100240 is 42001013450731.
137054310100240 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a tau number, because it is divible by the number of its divisors (80).
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 250061539 + ... + 250609021.
Almost surely, 2137054310100240 is an apocalyptic number.
137054310100240 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
137054310100240 is an abundant number, since it is smaller than the sum of its proper divisors (206110649561648).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
137054310100240 is a wasteful number, since it uses less digits than its factorization.
137054310100240 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 788216 (or 788210 counting only the distinct ones).
The product of its (nonzero) digits is 10080, while the sum is 31.
Adding to 137054310100240 its reverse (42001013450731), we get a palindrome (179055323550971).
The spelling of 137054310100240 in words is "one hundred thirty-seven trillion, fifty-four billion, three hundred ten million, one hundred thousand, two hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •