Base | Representation |
---|---|
bin | 10000011001111… |
… | …11100010000001 |
3 | 100120222000012101 |
4 | 20030333202001 |
5 | 240212424211 |
6 | 21353430401 |
7 | 3260532136 |
oct | 1014774201 |
9 | 316860171 |
10 | 137623681 |
11 | 70759788 |
12 | 3a10b401 |
13 | 22687840 |
14 | 143c658d |
15 | c1375c1 |
hex | 833f881 |
137623681 has 4 divisors (see below), whose sum is σ = 148210132. Its totient is φ = 127037232.
The previous prime is 137623679. The next prime is 137623691. The reversal of 137623681 is 186326731.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 70711281 + 66912400 = 8409^2 + 8180^2 .
It is a cyclic number.
It is not a de Polignac number, because 137623681 - 21 = 137623679 is a prime.
It is a super-2 number, since 2×1376236812 = 37880555143979522, which contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 137623681.
It is not an unprimeable number, because it can be changed into a prime (137623621) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 5293206 + ... + 5293231.
It is an arithmetic number, because the mean of its divisors is an integer number (37052533).
Almost surely, 2137623681 is an apocalyptic number.
It is an amenable number.
137623681 is a deficient number, since it is larger than the sum of its proper divisors (10586451).
137623681 is a wasteful number, since it uses less digits than its factorization.
137623681 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10586450.
The product of its digits is 36288, while the sum is 37.
The square root of 137623681 is about 11731.3119897137. The cubic root of 137623681 is about 516.2947670317.
The spelling of 137623681 in words is "one hundred thirty-seven million, six hundred twenty-three thousand, six hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •