Base | Representation |
---|---|
bin | 1000101111101100101… |
… | …0001011000011100011 |
3 | 112100210200000200220012 |
4 | 2023323022023003203 |
5 | 4430144103323003 |
6 | 153004233035135 |
7 | 13566103222565 |
oct | 2137312130343 |
9 | 470720020805 |
10 | 150242636003 |
11 | 58799062179 |
12 | 2514bb55aab |
13 | 11224914065 |
14 | 73b3ab1335 |
15 | 3d9505b8d8 |
hex | 22fb28b0e3 |
150242636003 has 4 divisors (see below), whose sum is σ = 152052788328. Its totient is φ = 148432483680.
The previous prime is 150242635999. The next prime is 150242636039. The reversal of 150242636003 is 300636242051.
150242636003 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 150242636003 - 22 = 150242635999 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (150242636303) 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 3 ways as a sum of consecutive naturals, for example, 905076038 + ... + 905076203.
It is an arithmetic number, because the mean of its divisors is an integer number (38013197082).
Almost surely, 2150242636003 is an apocalyptic number.
150242636003 is a deficient number, since it is larger than the sum of its proper divisors (1810152325).
150242636003 is an equidigital number, since it uses as much as digits as its factorization.
150242636003 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1810152324.
The product of its (nonzero) digits is 25920, while the sum is 32.
Adding to 150242636003 its reverse (300636242051), we get a palindrome (450878878054).
The spelling of 150242636003 in words is "one hundred fifty billion, two hundred forty-two million, six hundred thirty-six thousand, three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •