Base | Representation |
---|---|
bin | 111111110011001100… |
… | …0000111100000010101 |
3 | 111002122101201210102220 |
4 | 1333212120013200111 |
5 | 4221043310134203 |
6 | 142535135452553 |
7 | 12620132602044 |
oct | 1774630074025 |
9 | 432571653386 |
10 | 137009068053 |
11 | 53118057760 |
12 | 22678087159 |
13 | cbc6034090 |
14 | 68ba30655b |
15 | 386d36e653 |
hex | 1fe6607815 |
137009068053 has 32 divisors (see below), whose sum is σ = 214906513920. Its totient is φ = 76544533440.
The previous prime is 137009068051. The next prime is 137009068057. The reversal of 137009068053 is 350860900731.
It is not a de Polignac number, because 137009068053 - 21 = 137009068051 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 137009067996 and 137009068014.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (137009068051) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 100950 + ... + 533112.
It is an arithmetic number, because the mean of its divisors is an integer number (6715828560).
Almost surely, 2137009068053 is an apocalyptic number.
137009068053 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
137009068053 is a deficient number, since it is larger than the sum of its proper divisors (77897445867).
137009068053 is a wasteful number, since it uses less digits than its factorization.
137009068053 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 432929.
The product of its (nonzero) digits is 136080, while the sum is 42.
Adding to 137009068053 its reverse (350860900731), we get a palindrome (487869968784).
The spelling of 137009068053 in words is "one hundred thirty-seven billion, nine million, sixty-eight thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •