Base | Representation |
---|---|
bin | 1000101111011010000… |
… | …1100100111001100101 |
3 | 112100121020201112200212 |
4 | 2023312201210321211 |
5 | 4430014202310333 |
6 | 152552414345205 |
7 | 13564140314546 |
oct | 2136641447145 |
9 | 470536645625 |
10 | 150164885093 |
11 | 58759187823 |
12 | 25129abb205 |
13 | 112117905c2 |
14 | 73a76324cd |
15 | 3d8d2ee448 |
hex | 22f6864e65 |
150164885093 has 8 divisors (see below), whose sum is σ = 153849326400. Its totient is φ = 146481485920.
The previous prime is 150164885083. The next prime is 150164885161. The reversal of 150164885093 is 390588461051.
150164885093 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 150164885093 - 24 = 150164885077 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (150164885063) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 35258 + ... + 549156.
It is an arithmetic number, because the mean of its divisors is an integer number (19231165800).
Almost surely, 2150164885093 is an apocalyptic number.
It is an amenable number.
150164885093 is a deficient number, since it is larger than the sum of its proper divisors (3684441307).
150164885093 is an equidigital number, since it uses as much as digits as its factorization.
150164885093 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 521067.
The product of its (nonzero) digits is 1036800, while the sum is 50.
The spelling of 150164885093 in words is "one hundred fifty billion, one hundred sixty-four million, eight hundred eighty-five thousand, ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •