Base | Representation |
---|---|
bin | 1000110000101010011… |
… | …1101000101010110001 |
3 | 112101110202002122201012 |
4 | 2030022213220222301 |
5 | 4431212004031323 |
6 | 153050100320305 |
7 | 13605403020515 |
oct | 2141247505261 |
9 | 471422078635 |
10 | 150502017713 |
11 | 58911513523 |
12 | 252029a3095 |
13 | 1126658ca68 |
14 | 73da310145 |
15 | 3dacbe5678 |
hex | 230a9e8ab1 |
150502017713 has 16 divisors (see below), whose sum is σ = 158795640000. Its totient is φ = 142245945792.
The previous prime is 150502017709. The next prime is 150502017767. The reversal of 150502017713 is 317710205051.
It is a cyclic number.
It is not a de Polignac number, because 150502017713 - 22 = 150502017709 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 150502017713.
It is not an unprimeable number, because it can be changed into a prime (150502017313) 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 15 ways as a sum of consecutive naturals, for example, 29513438 + ... + 29518536.
It is an arithmetic number, because the mean of its divisors is an integer number (9924727500).
Almost surely, 2150502017713 is an apocalyptic number.
It is an amenable number.
150502017713 is a deficient number, since it is larger than the sum of its proper divisors (8293622287).
150502017713 is a wasteful number, since it uses less digits than its factorization.
150502017713 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8464.
The product of its (nonzero) digits is 7350, while the sum is 32.
The spelling of 150502017713 in words is "one hundred fifty billion, five hundred two million, seventeen thousand, seven hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •