Base | Representation |
---|---|
bin | 1000101111010000111… |
… | …1001100100111111111 |
3 | 112100111120112000120212 |
4 | 2023310033030213333 |
5 | 4424424341401024 |
6 | 152544524103035 |
7 | 13563163205525 |
oct | 2136417144777 |
9 | 470446460525 |
10 | 150126512639 |
11 | 58739558a54 |
12 | 25119094a7b |
13 | 112068467cc |
14 | 73a24c4315 |
15 | 3d89c6ea0e |
hex | 22f43cc9ff |
150126512639 has 4 divisors (see below), whose sum is σ = 150782087160. Its totient is φ = 149470938120.
The previous prime is 150126512629. The next prime is 150126512651. The reversal of 150126512639 is 936215621051.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 936215621051 = 507667 ⋅1844153.
It is a cyclic number.
It is not a de Polignac number, because 150126512639 - 228 = 149858077183 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 150126512596 and 150126512605.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (150126512629) 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, 327786917 + ... + 327787374.
It is an arithmetic number, because the mean of its divisors is an integer number (37695521790).
Almost surely, 2150126512639 is an apocalyptic number.
150126512639 is a deficient number, since it is larger than the sum of its proper divisors (655574521).
150126512639 is an equidigital number, since it uses as much as digits as its factorization.
150126512639 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 655574520.
The product of its (nonzero) digits is 97200, while the sum is 41.
The spelling of 150126512639 in words is "one hundred fifty billion, one hundred twenty-six million, five hundred twelve thousand, six hundred thirty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •