Base | Representation |
---|---|
bin | 10000011010011… |
… | …00000111011111 |
3 | 100121001121220122 |
4 | 20031030013133 |
5 | 240221101411 |
6 | 21354505155 |
7 | 3261135341 |
oct | 1015140737 |
9 | 317047818 |
10 | 137675231 |
11 | 70794491 |
12 | 3a1351bb |
13 | 226a5145 |
14 | 143db291 |
15 | c1479db |
hex | 834c1df |
137675231 has 8 divisors (see below), whose sum is σ = 148164624. Its totient is φ = 127451520.
The previous prime is 137675227. The next prime is 137675243. The reversal of 137675231 is 132576731.
137675231 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 137675231 - 22 = 137675227 is a prime.
It is a super-2 number, since 2×1376752312 = 37908938461806722, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 137675191 and 137675200.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (137675201) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 65345 + ... + 67418.
It is an arithmetic number, because the mean of its divisors is an integer number (18520578).
Almost surely, 2137675231 is an apocalyptic number.
137675231 is a deficient number, since it is larger than the sum of its proper divisors (10489393).
137675231 is a wasteful number, since it uses less digits than its factorization.
137675231 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 132841.
The product of its digits is 26460, while the sum is 35.
The square root of 137675231 is about 11733.5088954669. The cubic root of 137675231 is about 516.3592222007.
The spelling of 137675231 in words is "one hundred thirty-seven million, six hundred seventy-five thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •