Base | Representation |
---|---|
bin | 10000101011100… |
… | …01110000001001 |
3 | 100202022000010100 |
4 | 20111301300021 |
5 | 241310122122 |
6 | 21515040013 |
7 | 3316233042 |
oct | 1025616011 |
9 | 322260110 |
10 | 139926537 |
11 | 71a91973 |
12 | 3aa40009 |
13 | 22cb2a8a |
14 | 148258c9 |
15 | c43eaac |
hex | 8571c09 |
139926537 has 24 divisors (see below), whose sum is σ = 209968200. Its totient is φ = 89687808.
The previous prime is 139926517. The next prime is 139926547. The reversal of 139926537 is 735629931.
139926537 is a `hidden beast` number, since 1 + 3 + 99 + 26 + 537 = 666.
It can be written as a sum of positive squares in 4 ways, for example, as 9418761 + 130507776 = 3069^2 + 11424^2 .
It is a de Polignac number, because none of the positive numbers 2k-139926537 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 139926492 and 139926501.
It is not an unprimeable number, because it can be changed into a prime (139926517) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 69213 + ... + 71205.
It is an arithmetic number, because the mean of its divisors is an integer number (8748675).
Almost surely, 2139926537 is an apocalyptic number.
It is an amenable number.
139926537 is a deficient number, since it is larger than the sum of its proper divisors (70041663).
139926537 is a wasteful number, since it uses less digits than its factorization.
139926537 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2297 (or 2294 counting only the distinct ones).
The product of its digits is 306180, while the sum is 45.
The square root of 139926537 is about 11829.0547804970. The cubic root of 139926537 is about 519.1585713911.
The spelling of 139926537 in words is "one hundred thirty-nine million, nine hundred twenty-six thousand, five hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •