Base | Representation |
---|---|
bin | 1000110000000001100… |
… | …1011001011001101001 |
3 | 112101000210101022110211 |
4 | 2030000121121121221 |
5 | 4430334102404001 |
6 | 153021052341121 |
7 | 13601221164004 |
oct | 2140031313151 |
9 | 471023338424 |
10 | 150330513001 |
11 | 58833723499 |
12 | 251754747a1 |
13 | 11239ba1896 |
14 | 73c162853b |
15 | 3d9cb19351 |
hex | 2300659669 |
150330513001 has 4 divisors (see below), whose sum is σ = 159173484372. Its totient is φ = 141487541632.
The previous prime is 150330512971. The next prime is 150330513037. The reversal of 150330513001 is 100315033051.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 100315033051 = 941 ⋅106604711.
It can be written as a sum of positive squares in 2 ways, for example, as 130448102976 + 19882410025 = 361176^2 + 141005^2 .
It is a cyclic number.
It is not a de Polignac number, because 150330513001 - 215 = 150330480233 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (150330513041) 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, 4421485660 + ... + 4421485693.
It is an arithmetic number, because the mean of its divisors is an integer number (39793371093).
Almost surely, 2150330513001 is an apocalyptic number.
It is an amenable number.
150330513001 is a deficient number, since it is larger than the sum of its proper divisors (8842971371).
150330513001 is an equidigital number, since it uses as much as digits as its factorization.
150330513001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8842971370.
The product of its (nonzero) digits is 675, while the sum is 22.
Adding to 150330513001 its reverse (100315033051), we get a palindrome (250645546052).
The spelling of 150330513001 in words is "one hundred fifty billion, three hundred thirty million, five hundred thirteen thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •