Base | Representation |
---|---|
bin | 1000111000101101100… |
… | …1010111111101101011 |
3 | 112121001022111120022022 |
4 | 2032023121113331223 |
5 | 10000123102241024 |
6 | 154044320015055 |
7 | 14013056115644 |
oct | 2161331277553 |
9 | 477038446268 |
10 | 152662540139 |
11 | 59820029a4a |
12 | 2570646148b |
13 | 1151c07b5b5 |
14 | 75632326cb |
15 | 3e8771535e |
hex | 238b657f6b |
152662540139 has 4 divisors (see below), whose sum is σ = 157587138240. Its totient is φ = 147737942040.
The previous prime is 152662540117. The next prime is 152662540309. The reversal of 152662540139 is 931045266251.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-152662540139 is a prime.
It is a super-2 number, since 2×1526625401392 (a number of 23 digits) contains 22 as substring.
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 152662540139.
It is not an unprimeable number, because it can be changed into a prime (152662540339) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2462299004 + ... + 2462299065.
It is an arithmetic number, because the mean of its divisors is an integer number (39396784560).
Almost surely, 2152662540139 is an apocalyptic number.
152662540139 is a deficient number, since it is larger than the sum of its proper divisors (4924598101).
152662540139 is an equidigital number, since it uses as much as digits as its factorization.
152662540139 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4924598100.
The product of its (nonzero) digits is 388800, while the sum is 44.
The spelling of 152662540139 in words is "one hundred fifty-two billion, six hundred sixty-two million, five hundred forty thousand, one hundred thirty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •