Base | Representation |
---|---|
bin | 1000000110111100001… |
… | …0110000010111100011 |
3 | 111022120012012002211212 |
4 | 2001233002300113203 |
5 | 4240242244244401 |
6 | 143554444100335 |
7 | 13031014003634 |
oct | 2015702602743 |
9 | 438505162755 |
10 | 139301946851 |
11 | 54094354511 |
12 | 22bb7b346ab |
13 | 101a0084ab2 |
14 | 6a56a3d88b |
15 | 39547d5dbb |
hex | 206f0b05e3 |
139301946851 has 2 divisors, whose sum is σ = 139301946852. Its totient is φ = 139301946850.
The previous prime is 139301946841. The next prime is 139301946877. The reversal of 139301946851 is 158649103931.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 139301946851 - 26 = 139301946787 is a prime.
It is a Sophie Germain prime.
It is a self number, because there is not a number n which added to its sum of digits gives 139301946851.
It is not a weakly prime, because it can be changed into another prime (139301946841) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 69650973425 + 69650973426.
It is an arithmetic number, because the mean of its divisors is an integer number (69650973426).
Almost surely, 2139301946851 is an apocalyptic number.
139301946851 is a deficient number, since it is larger than the sum of its proper divisors (1).
139301946851 is an equidigital number, since it uses as much as digits as its factorization.
139301946851 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 699840, while the sum is 50.
The spelling of 139301946851 in words is "one hundred thirty-nine billion, three hundred one million, nine hundred forty-six thousand, eight hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •