Base | Representation |
---|---|
bin | 1000110000101011010… |
… | …1010011100110000101 |
3 | 112101110222211201121211 |
4 | 2030022311103212011 |
5 | 4431213413221123 |
6 | 153050305211421 |
7 | 13605445334566 |
oct | 2141265234605 |
9 | 471428751554 |
10 | 150505601413 |
11 | 58913540a62 |
12 | 25204030b71 |
13 | 11267245cab |
14 | 73da9a416d |
15 | 3dad1a240d |
hex | 230ad53985 |
150505601413 has 8 divisors (see below), whose sum is σ = 153192798720. Its totient is φ = 147834165360.
The previous prime is 150505601357. The next prime is 150505601419. The reversal of 150505601413 is 314106505051.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 150505601413 - 213 = 150505593221 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (150505601419) 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, 3921045 + ... + 3959242.
It is an arithmetic number, because the mean of its divisors is an integer number (19149099840).
Almost surely, 2150505601413 is an apocalyptic number.
It is an amenable number.
150505601413 is a deficient number, since it is larger than the sum of its proper divisors (2687197307).
150505601413 is an equidigital number, since it uses as much as digits as its factorization.
150505601413 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7880627.
The product of its (nonzero) digits is 9000, while the sum is 31.
The spelling of 150505601413 in words is "one hundred fifty billion, five hundred five million, six hundred one thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •