Base | Representation |
---|---|
bin | 1000000111000011110… |
… | …0001001111001100011 |
3 | 111022122102001221011112 |
4 | 2001300330021321203 |
5 | 4240323421131401 |
6 | 144001542133535 |
7 | 13031551340162 |
oct | 2016074117143 |
9 | 438572057145 |
10 | 139333770851 |
11 | 54100310340 |
12 | 230067212ab |
13 | 101a6848072 |
14 | 6a5ad653d9 |
15 | 39574c03bb |
hex | 2070f09e63 |
139333770851 has 8 divisors (see below), whose sum is σ = 158609193984. Its totient is φ = 121159800520.
The previous prime is 139333770841. The next prime is 139333770853. The reversal of 139333770851 is 158077333931.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a de Polignac number, because none of the positive numbers 2k-139333770851 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 139333770851.
It is not an unprimeable number, because it can be changed into a prime (139333770853) 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 in 7 ways as a sum of consecutive naturals, for example, 275362931 + ... + 275363436.
It is an arithmetic number, because the mean of its divisors is an integer number (19826149248).
Almost surely, 2139333770851 is an apocalyptic number.
139333770851 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
139333770851 is a deficient number, since it is larger than the sum of its proper divisors (19275423133).
139333770851 is a wasteful number, since it uses less digits than its factorization.
139333770851 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 550726401.
The product of its (nonzero) digits is 1428840, while the sum is 50.
The spelling of 139333770851 in words is "one hundred thirty-nine billion, three hundred thirty-three million, seven hundred seventy thousand, eight hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •