Base | Representation |
---|---|
bin | 111111110011001100… |
… | …0000111100000010110 |
3 | 111002122101201210102221 |
4 | 1333212120013200112 |
5 | 4221043310134204 |
6 | 142535135452554 |
7 | 12620132602045 |
oct | 1774630074026 |
9 | 432571653387 |
10 | 137009068054 |
11 | 53118057761 |
12 | 2267808715a |
13 | cbc6034091 |
14 | 68ba30655c |
15 | 386d36e654 |
hex | 1fe6607816 |
137009068054 has 8 divisors (see below), whose sum is σ = 206161910928. Its totient is φ = 68288431080.
The previous prime is 137009068051. The next prime is 137009068057. The reversal of 137009068054 is 450860900731.
It is an interprime number because it is at equal distance from previous prime (137009068051) and next prime (137009068057).
It is a sphenic number, since it is the product of 3 distinct primes.
It is a self number, because there is not a number n which added to its sum of digits gives 137009068054.
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 3 ways as a sum of consecutive naturals, for example, 108050682 + ... + 108051949.
It is an arithmetic number, because the mean of its divisors is an integer number (25770238866).
Almost surely, 2137009068054 is an apocalyptic number.
137009068054 is a deficient number, since it is larger than the sum of its proper divisors (69152842874).
137009068054 is a wasteful number, since it uses less digits than its factorization.
137009068054 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 216102950.
The product of its (nonzero) digits is 181440, while the sum is 43.
Adding to 137009068054 its reverse (450860900731), we get a palindrome (587869968785).
The spelling of 137009068054 in words is "one hundred thirty-seven billion, nine million, sixty-eight thousand, fifty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •