Base | Representation |
---|---|
bin | 1000101110110011001… |
… | …1001000101100100001 |
3 | 112100011212200200210011 |
4 | 2023230303020230201 |
5 | 4424200414403001 |
6 | 152524305204521 |
7 | 13560116356114 |
oct | 2135463105441 |
9 | 470155620704 |
10 | 150001716001 |
11 | 58685070435 |
12 | 250a3330741 |
13 | 111b6a30547 |
14 | 738daba57b |
15 | 3d7dd1cd51 |
hex | 22eccc8b21 |
150001716001 has 4 divisors (see below), whose sum is σ = 158825346372. Its totient is φ = 141178085632.
The previous prime is 150001715953. The next prime is 150001716017. The reversal of 150001716001 is 100617100051.
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 68319504400 + 81682211601 = 261380^2 + 285801^2 .
It is a cyclic number.
It is not a de Polignac number, because 150001716001 - 233 = 141411781409 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (150001716041) 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 3 ways as a sum of consecutive naturals, for example, 4411815160 + ... + 4411815193.
It is an arithmetic number, because the mean of its divisors is an integer number (39706336593).
Almost surely, 2150001716001 is an apocalyptic number.
It is an amenable number.
150001716001 is a deficient number, since it is larger than the sum of its proper divisors (8823630371).
150001716001 is an equidigital number, since it uses as much as digits as its factorization.
150001716001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8823630370.
The product of its (nonzero) digits is 210, while the sum is 22.
Adding to 150001716001 its reverse (100617100051), we get a palindrome (250618816052).
The spelling of 150001716001 in words is "one hundred fifty billion, one million, seven hundred sixteen thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •