Base | Representation |
---|---|
bin | 1000000110101010100… |
… | …0000011111101100011 |
3 | 111022101000202002211211 |
4 | 2001222220003331203 |
5 | 4240114311342410 |
6 | 143543235450551 |
7 | 13026124055002 |
oct | 2015250037543 |
9 | 438330662754 |
10 | 139227840355 |
11 | 5405653917a |
12 | 22b97156a57 |
13 | 1018a9090b6 |
14 | 6a4ac6cc39 |
15 | 394d04868a |
hex | 206aa03f63 |
139227840355 has 4 divisors (see below), whose sum is σ = 167073408432. Its totient is φ = 111382272280.
The previous prime is 139227840343. The next prime is 139227840359. The reversal of 139227840355 is 553048722931.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 553048722931 = 103 ⋅5369405077.
It is not a de Polignac number, because 139227840355 - 223 = 139219451747 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 139227840299 and 139227840308.
It is not an unprimeable number, because it can be changed into a prime (139227840359) 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 3 ways as a sum of consecutive naturals, for example, 13922784031 + ... + 13922784040.
It is an arithmetic number, because the mean of its divisors is an integer number (41768352108).
Almost surely, 2139227840355 is an apocalyptic number.
139227840355 is a deficient number, since it is larger than the sum of its proper divisors (27845568077).
139227840355 is an equidigital number, since it uses as much as digits as its factorization.
139227840355 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 27845568076.
The product of its (nonzero) digits is 1814400, while the sum is 49.
The spelling of 139227840355 in words is "one hundred thirty-nine billion, two hundred twenty-seven million, eight hundred forty thousand, three hundred fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •