Base | Representation |
---|---|
bin | 10000101000100… |
… | …11101101010101 |
3 | 100201120102201112 |
4 | 20110103231111 |
5 | 241210310313 |
6 | 21502504405 |
7 | 3313040021 |
oct | 1024235525 |
9 | 321512645 |
10 | 139541333 |
11 | 71849518 |
12 | 3a895105 |
13 | 22ba9649 |
14 | 14765381 |
15 | c3b58a8 |
hex | 8513b55 |
139541333 has 2 divisors, whose sum is σ = 139541334. Its totient is φ = 139541332.
The previous prime is 139541309. The next prime is 139541351. The reversal of 139541333 is 333145931.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 138839089 + 702244 = 11783^2 + 838^2 .
It is an emirp because it is prime and its reverse (333145931) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 139541333 - 210 = 139540309 is a prime.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 139541333.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (139541383) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 69770666 + 69770667.
It is an arithmetic number, because the mean of its divisors is an integer number (69770667).
Almost surely, 2139541333 is an apocalyptic number.
It is an amenable number.
139541333 is a deficient number, since it is larger than the sum of its proper divisors (1).
139541333 is an equidigital number, since it uses as much as digits as its factorization.
139541333 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 14580, while the sum is 32.
The square root of 139541333 is about 11812.7614468421. The cubic root of 139541333 is about 518.6817360601.
The spelling of 139541333 in words is "one hundred thirty-nine million, five hundred forty-one thousand, three hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •