Base | Representation |
---|---|
bin | 1000110001010000001… |
… | …0100000010111100110 |
3 | 112101212202110212020110 |
4 | 2030110002200113212 |
5 | 4432022433302200 |
6 | 153113503513450 |
7 | 13612332231243 |
oct | 2142402402746 |
9 | 471782425213 |
10 | 150660056550 |
11 | 58992746433 |
12 | 252478b8886 |
13 | 11290244973 |
14 | 74132cc5ca |
15 | 3dbba11b50 |
hex | 23140a05e6 |
150660056550 has 24 divisors (see below), whose sum is σ = 373636940616. Its totient is φ = 40176015040.
The previous prime is 150660056549. The next prime is 150660056563. The reversal of 150660056550 is 55650066051.
It is a junction number, because it is equal to n+sod(n) for n = 150660056499 and 150660056508.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 502200039 + ... + 502200338.
It is an arithmetic number, because the mean of its divisors is an integer number (15568205859).
Almost surely, 2150660056550 is an apocalyptic number.
150660056550 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
150660056550 is an abundant number, since it is smaller than the sum of its proper divisors (222976884066).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
150660056550 is a wasteful number, since it uses less digits than its factorization.
150660056550 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1004400392 (or 1004400387 counting only the distinct ones).
The product of its (nonzero) digits is 135000, while the sum is 39.
The spelling of 150660056550 in words is "one hundred fifty billion, six hundred sixty million, fifty-six thousand, five hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •