Base | Representation |
---|---|
bin | 1000000110011000001… |
… | …0000100111111111001 |
3 | 111022011122201202001012 |
4 | 2001212002010333321 |
5 | 4234440044234030 |
6 | 143531444003305 |
7 | 13024200031346 |
oct | 2014602047771 |
9 | 438148652035 |
10 | 139150774265 |
11 | 54016a91298 |
12 | 22b75390535 |
13 | 10177965269 |
14 | 6a4092b7cd |
15 | 39463c4095 |
hex | 2066084ff9 |
139150774265 has 4 divisors (see below), whose sum is σ = 166980929124. Its totient is φ = 111320619408.
The previous prime is 139150774219. The next prime is 139150774283. The reversal of 139150774265 is 562477051931.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 562477051931 = 23 ⋅24455523997.
It can be written as a sum of positive squares in 2 ways, for example, as 49757548096 + 89393226169 = 223064^2 + 298987^2 .
It is a cyclic number.
It is not a de Polignac number, because 139150774265 - 210 = 139150773241 is a prime.
It is a Duffinian number.
It is an unprimeable number.
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, 13915077422 + ... + 13915077431.
It is an arithmetic number, because the mean of its divisors is an integer number (41745232281).
Almost surely, 2139150774265 is an apocalyptic number.
It is an amenable number.
139150774265 is a deficient number, since it is larger than the sum of its proper divisors (27830154859).
139150774265 is an equidigital number, since it uses as much as digits as its factorization.
139150774265 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 27830154858.
The product of its (nonzero) digits is 1587600, while the sum is 50.
The spelling of 139150774265 in words is "one hundred thirty-nine billion, one hundred fifty million, seven hundred seventy-four thousand, two hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •