Base | Representation |
---|---|
bin | 1000110000110001010… |
… | …0010011000101111001 |
3 | 112101112201200212020001 |
4 | 2030030110103011321 |
5 | 4431241302044113 |
6 | 153052555033001 |
7 | 13606200110221 |
oct | 2141424230571 |
9 | 471481625201 |
10 | 150530503033 |
11 | 589265a9a09 |
12 | 2521043b761 |
13 | 1126c454491 |
14 | 7400007081 |
15 | 3db04707dd |
hex | 230c513179 |
150530503033 has 4 divisors (see below), whose sum is σ = 150539517940. Its totient is φ = 150521488128.
The previous prime is 150530503009. The next prime is 150530503037. The reversal of 150530503033 is 330305035051.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 79576460649 + 70954042384 = 282093^2 + 266372^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-150530503033 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 150530502992 and 150530503010.
It is not an unprimeable number, because it can be changed into a prime (150530503037) 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, 4482360 + ... + 4515817.
It is an arithmetic number, because the mean of its divisors is an integer number (37634879485).
Almost surely, 2150530503033 is an apocalyptic number.
It is an amenable number.
150530503033 is a deficient number, since it is larger than the sum of its proper divisors (9014907).
150530503033 is an equidigital number, since it uses as much as digits as its factorization.
150530503033 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 9014906.
The product of its (nonzero) digits is 10125, while the sum is 28.
Adding to 150530503033 its reverse (330305035051), we get a palindrome (480835538084).
The spelling of 150530503033 in words is "one hundred fifty billion, five hundred thirty million, five hundred three thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •