Base | Representation |
---|---|
bin | 111111111011001011… |
… | …0000000001000111100 |
3 | 111010100001210120002101 |
4 | 1333312112000020330 |
5 | 4222120344332202 |
6 | 143021505234444 |
7 | 12626564546155 |
oct | 1776626001074 |
9 | 433301716071 |
10 | 137276949052 |
11 | 53245293711 |
12 | 22731932a24 |
13 | cc39697549 |
14 | 6903b1892c |
15 | 3886b36887 |
hex | 1ff658023c |
137276949052 has 6 divisors (see below), whose sum is σ = 240234660848. Its totient is φ = 68638474524.
The previous prime is 137276948993. The next prime is 137276949079. The reversal of 137276949052 is 250949672731.
It is a junction number, because it is equal to n+sod(n) for n = 137276948984 and 137276949002.
It is a congruent number.
It is an unprimeable number.
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 as a sum of consecutive naturals, namely, 17159618628 + ... + 17159618635.
Almost surely, 2137276949052 is an apocalyptic number.
It is an amenable number.
137276949052 is a deficient number, since it is larger than the sum of its proper divisors (102957711796).
137276949052 is a wasteful number, since it uses less digits than its factorization.
137276949052 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 34319237267 (or 34319237265 counting only the distinct ones).
The product of its (nonzero) digits is 5715360, while the sum is 55.
The spelling of 137276949052 in words is "one hundred thirty-seven billion, two hundred seventy-six million, nine hundred forty-nine thousand, fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •