Base | Representation |
---|---|
bin | 1000110000111001100… |
… | …1101011000110010001 |
3 | 112101122011111012002202 |
4 | 2030032121223012101 |
5 | 4431324224412023 |
6 | 153100244252545 |
7 | 13610103230450 |
oct | 2141631530621 |
9 | 471564435082 |
10 | 150565466513 |
11 | 5894430a550 |
12 | 252200a1155 |
13 | 11276776727 |
14 | 7404908b97 |
15 | 3db357a128 |
hex | 230e66b191 |
150565466513 has 32 divisors (see below), whose sum is σ = 196518389760. Its totient is φ = 111856757760.
The previous prime is 150565466479. The next prime is 150565466549. The reversal of 150565466513 is 315664565051.
It is not a de Polignac number, because 150565466513 - 26 = 150565466449 is a prime.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (150565463513) 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 31 ways as a sum of consecutive naturals, for example, 405233 + ... + 682161.
It is an arithmetic number, because the mean of its divisors is an integer number (6141199680).
Almost surely, 2150565466513 is an apocalyptic number.
It is an amenable number.
150565466513 is a deficient number, since it is larger than the sum of its proper divisors (45952923247).
150565466513 is a wasteful number, since it uses less digits than its factorization.
150565466513 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 277277.
The product of its (nonzero) digits is 1620000, while the sum is 47.
The spelling of 150565466513 in words is "one hundred fifty billion, five hundred sixty-five million, four hundred sixty-six thousand, five hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •