Base | Representation |
---|---|
bin | 10000100110100… |
… | …01110110011101 |
3 | 100201001201200201 |
4 | 20103101312131 |
5 | 241123142311 |
6 | 21453023501 |
7 | 3310534411 |
oct | 1023216635 |
9 | 321051621 |
10 | 139271581 |
11 | 71684889 |
12 | 3a784b91 |
13 | 22b13927 |
14 | 146d4d41 |
15 | c3609c1 |
hex | 84d1d9d |
139271581 has 2 divisors, whose sum is σ = 139271582. Its totient is φ = 139271580.
The previous prime is 139271569. The next prime is 139271603. The reversal of 139271581 is 185172931.
139271581 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 136679481 + 2592100 = 11691^2 + 1610^2 .
It is a cyclic number.
It is not a de Polignac number, because 139271581 - 225 = 105717149 is a prime.
It is a super-2 number, since 2×1392715812 = 38793146548479122, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 139271581.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (139271551) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 69635790 + 69635791.
It is an arithmetic number, because the mean of its divisors is an integer number (69635791).
Almost surely, 2139271581 is an apocalyptic number.
It is an amenable number.
139271581 is a deficient number, since it is larger than the sum of its proper divisors (1).
139271581 is an equidigital number, since it uses as much as digits as its factorization.
139271581 is an evil number, because the sum of its binary digits is even.
The product of its digits is 15120, while the sum is 37.
The square root of 139271581 is about 11801.3381020967. The cubic root of 139271581 is about 518.3472934784.
The spelling of 139271581 in words is "one hundred thirty-nine million, two hundred seventy-one thousand, five hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •