Base | Representation |
---|---|
bin | 1000101110111001001… |
… | …0011100101001111111 |
3 | 112100020121201002100202 |
4 | 2023232102130221333 |
5 | 4424223313421224 |
6 | 152531000514115 |
7 | 13560541631006 |
oct | 2135622345177 |
9 | 470217632322 |
10 | 150026701439 |
11 | 5869818635a |
12 | 250ab77b93b |
13 | 111bbc6ac24 |
14 | 7393141c3d |
15 | 3d81105eae |
hex | 22ee49ca7f |
150026701439 has 4 divisors (see below), whose sum is σ = 157922843640. Its totient is φ = 142130559240.
The previous prime is 150026701397. The next prime is 150026701453. The reversal of 150026701439 is 934107620051.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 934107620051 = 77839 ⋅12000509.
It is a cyclic number.
It is not a de Polignac number, because 150026701439 - 212 = 150026697343 is a prime.
It is a super-2 number, since 2×1500267014392 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (150026701499) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3948071072 + ... + 3948071109.
It is an arithmetic number, because the mean of its divisors is an integer number (39480710910).
Almost surely, 2150026701439 is an apocalyptic number.
150026701439 is a gapful number since it is divisible by the number (19) formed by its first and last digit.
150026701439 is a deficient number, since it is larger than the sum of its proper divisors (7896142201).
150026701439 is an equidigital number, since it uses as much as digits as its factorization.
150026701439 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7896142200.
The product of its (nonzero) digits is 45360, while the sum is 38.
The spelling of 150026701439 in words is "one hundred fifty billion, twenty-six million, seven hundred one thousand, four hundred thirty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •