Base | Representation |
---|---|
bin | 1000110000000000111… |
… | …0010010001111001101 |
3 | 112101000120220022200202 |
4 | 2030000032102033031 |
5 | 4430332331200302 |
6 | 153020510103245 |
7 | 13601154342344 |
oct | 2140016221715 |
9 | 471016808622 |
10 | 150327600077 |
11 | 58832013a16 |
12 | 251744aab25 |
13 | 112393c1a65 |
14 | 73c10aab5b |
15 | 3d9c741202 |
hex | 23003923cd |
150327600077 has 4 divisors (see below), whose sum is σ = 150346716576. Its totient is φ = 150308483580.
The previous prime is 150327600037. The next prime is 150327600083. The reversal of 150327600077 is 770006723051.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 770006723051 = 457 ⋅1684916243.
It is a cyclic number.
It is not a de Polignac number, because 150327600077 - 210 = 150327599053 is a prime.
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 150327600077.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (150327600037) 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, 9546449 + ... + 9562182.
It is an arithmetic number, because the mean of its divisors is an integer number (37586679144).
Almost surely, 2150327600077 is an apocalyptic number.
It is an amenable number.
150327600077 is a deficient number, since it is larger than the sum of its proper divisors (19116499).
150327600077 is an equidigital number, since it uses as much as digits as its factorization.
150327600077 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19116498.
The product of its (nonzero) digits is 61740, while the sum is 38.
The spelling of 150327600077 in words is "one hundred fifty billion, three hundred twenty-seven million, six hundred thousand, seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •