Base | Representation |
---|---|
bin | 11111000110011000101… |
… | …111010001101011101001 |
3 | 21120022101102222121122102 |
4 | 133012120233101223221 |
5 | 240003401241314022 |
6 | 4313444235103145 |
7 | 310255564054346 |
oct | 37063057215351 |
9 | 7508342877572 |
10 | 2137161276137 |
11 | 754401908748 |
12 | 2a6242ba1ab5 |
13 | 1266c1c8b3b4 |
14 | 756210977cd |
15 | 3a8d48b5a92 |
hex | 1f198bd1ae9 |
2137161276137 has 8 divisors (see below), whose sum is σ = 2219312159232. Its totient is φ = 2055836030400.
The previous prime is 2137161276049. The next prime is 2137161276191. The reversal of 2137161276137 is 7316721617312.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 2137161276137 - 210 = 2137161275113 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2137161276091 and 2137161276100.
It is not an unprimeable number, because it can be changed into a prime (2137161276737) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 206404064 + ... + 206414417.
It is an arithmetic number, because the mean of its divisors is an integer number (277414019904).
Almost surely, 22137161276137 is an apocalyptic number.
It is an amenable number.
2137161276137 is a deficient number, since it is larger than the sum of its proper divisors (82150883095).
2137161276137 is a wasteful number, since it uses less digits than its factorization.
2137161276137 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 412818679.
The product of its digits is 444528, while the sum is 47.
The spelling of 2137161276137 in words is "two trillion, one hundred thirty-seven billion, one hundred sixty-one million, two hundred seventy-six thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •