Base | Representation |
---|---|
bin | 100010001101001100101100… |
… | …011010010001010010100100 |
3 | 201201122222101121102101002202 |
4 | 202031030230122101102210 |
5 | 124204304234011423220 |
6 | 1251543235151354032 |
7 | 43454654301553664 |
oct | 4215145432212244 |
9 | 651588347371082 |
10 | 150440564561060 |
11 | 43a31537798794 |
12 | 14a58480822918 |
13 | 65c363b1c78b7 |
14 | 292150db4a1a4 |
15 | 125d48717c275 |
hex | 88d32c6914a4 |
150440564561060 has 48 divisors (see below), whose sum is σ = 334510211064960. Its totient is φ = 56636246177280.
The previous prime is 150440564560969. The next prime is 150440564561137. The reversal of 150440564561060 is 60165465044051.
It is a junction number, because it is equal to n+sod(n) for n = 150440564560996 and 150440564561014.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 123760025 + ... + 124969695.
It is an arithmetic number, because the mean of its divisors is an integer number (6968962730520).
Almost surely, 2150440564561060 is an apocalyptic number.
150440564561060 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
150440564561060 is an abundant number, since it is smaller than the sum of its proper divisors (184069646503900).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
150440564561060 is a wasteful number, since it uses less digits than its factorization.
150440564561060 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1575476 (or 1575474 counting only the distinct ones).
The product of its (nonzero) digits is 1728000, while the sum is 47.
The spelling of 150440564561060 in words is "one hundred fifty trillion, four hundred forty billion, five hundred sixty-four million, five hundred sixty-one thousand, sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •