Base | Representation |
---|---|
bin | 1000101111100110001… |
… | …1001110110100000000 |
3 | 112100201210020200211100 |
4 | 2023321203032310000 |
5 | 4430120201304220 |
6 | 153001430414400 |
7 | 13565324651043 |
oct | 2137143166400 |
9 | 470653220740 |
10 | 150215650560 |
11 | 58784900658 |
12 | 25142b01400 |
13 | 1121c156241 |
14 | 73b0288c5a |
15 | 3d929cad90 |
hex | 22f98ced00 |
150215650560 has 108 divisors (see below), whose sum is σ = 519730543332. Its totient is φ = 40057503744.
The previous prime is 150215650553. The next prime is 150215650573. The reversal of 150215650560 is 65056512051.
150215650560 is a `hidden beast` number, since 1 + 502 + 1 + 56 + 50 + 56 + 0 = 666.
It can be written as a sum of positive squares in 2 ways, for example, as 66217699584 + 83997950976 = 257328^2 + 289824^2 .
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is an unprimeable number.
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 11 ways as a sum of consecutive naturals, for example, 6508257 + ... + 6531296.
Almost surely, 2150215650560 is an apocalyptic number.
150215650560 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
150215650560 is an abundant number, since it is smaller than the sum of its proper divisors (369514892772).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
150215650560 is a wasteful number, since it uses less digits than its factorization.
150215650560 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13039580 (or 13039563 counting only the distinct ones).
The product of its (nonzero) digits is 45000, while the sum is 36.
The spelling of 150215650560 in words is "one hundred fifty billion, two hundred fifteen million, six hundred fifty thousand, five hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •