Base | Representation |
---|---|
bin | 1000001000111001101… |
… | …1000111110111010001 |
3 | 111100220212212010112121 |
4 | 2002032123013313101 |
5 | 4242332034200431 |
6 | 144123012254241 |
7 | 13050036013045 |
oct | 2021633076721 |
9 | 440825763477 |
10 | 139828428241 |
11 | 543345587a7 |
12 | 23124311381 |
13 | 1025517c448 |
14 | 6aa692a025 |
15 | 3985b30611 |
hex | 208e6c7dd1 |
139828428241 has 2 divisors, whose sum is σ = 139828428242. Its totient is φ = 139828428240.
The previous prime is 139828428239. The next prime is 139828428301. The reversal of 139828428241 is 142824828931.
139828428241 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., 111672930625 + 28155497616 = 334175^2 + 167796^2 .
It is a cyclic number.
It is not a de Polignac number, because 139828428241 - 21 = 139828428239 is a prime.
Together with 139828428239, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (139828428841) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 69914214120 + 69914214121.
It is an arithmetic number, because the mean of its divisors is an integer number (69914214121).
Almost surely, 2139828428241 is an apocalyptic number.
It is an amenable number.
139828428241 is a deficient number, since it is larger than the sum of its proper divisors (1).
139828428241 is an equidigital number, since it uses as much as digits as its factorization.
139828428241 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 1769472, while the sum is 52.
The spelling of 139828428241 in words is "one hundred thirty-nine billion, eight hundred twenty-eight million, four hundred twenty-eight thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •