Base | Representation |
---|---|
bin | 1000110001000101011… |
… | …0101000010111101001 |
3 | 112101202121200210000211 |
4 | 2030101112220113221 |
5 | 4431424420004203 |
6 | 153105214101121 |
7 | 13611244244533 |
oct | 2142126502751 |
9 | 471677623024 |
10 | 150615000553 |
11 | 5896a272176 |
12 | 252347aa7a1 |
13 | 11283acaa04 |
14 | 740b320853 |
15 | 3db7ab1c6d |
hex | 23115a85e9 |
150615000553 has 8 divisors (see below), whose sum is σ = 152381104200. Its totient is φ = 148850537088.
The previous prime is 150615000527. The next prime is 150615000587. The reversal of 150615000553 is 355000516051.
It can be written as a sum of positive squares in 4 ways, for example, as 17825454144 + 132789546409 = 133512^2 + 364403^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-150615000553 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (150615060553) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 224826 + ... + 593107.
It is an arithmetic number, because the mean of its divisors is an integer number (19047638025).
Almost surely, 2150615000553 is an apocalyptic number.
It is an amenable number.
150615000553 is a deficient number, since it is larger than the sum of its proper divisors (1766103647).
150615000553 is an equidigital number, since it uses as much as digits as its factorization.
150615000553 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 820091.
The product of its (nonzero) digits is 11250, while the sum is 31.
The spelling of 150615000553 in words is "one hundred fifty billion, six hundred fifteen million, five hundred fifty-three", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •