Base | Representation |
---|---|
bin | 1000110000010011110… |
… | …1110101010000010011 |
3 | 112101020010122001102012 |
4 | 2030010331311100103 |
5 | 4431013214020024 |
6 | 153032431413135 |
7 | 13603141606646 |
oct | 2140475652023 |
9 | 471203561365 |
10 | 150407173139 |
11 | 58872a23383 |
12 | 251970841ab |
13 | 1124ca32a02 |
14 | 73cb8a1a5d |
15 | 3da470d50e |
hex | 2304f75413 |
150407173139 has 4 divisors (see below), whose sum is σ = 152956447320. Its totient is φ = 147857898960.
The previous prime is 150407173099. The next prime is 150407173157. The reversal of 150407173139 is 931371704051.
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-150407173139 is a prime.
It is a super-2 number, since 2×1504071731392 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 150407173096 and 150407173105.
It is not an unprimeable number, because it can be changed into a prime (150406173139) 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, 1274637002 + ... + 1274637119.
It is an arithmetic number, because the mean of its divisors is an integer number (38239111830).
Almost surely, 2150407173139 is an apocalyptic number.
150407173139 is a deficient number, since it is larger than the sum of its proper divisors (2549274181).
150407173139 is an equidigital number, since it uses as much as digits as its factorization.
150407173139 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2549274180.
The product of its (nonzero) digits is 79380, while the sum is 41.
The spelling of 150407173139 in words is "one hundred fifty billion, four hundred seven million, one hundred seventy-three thousand, one hundred thirty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •