Base | Representation |
---|---|
bin | 100010001101000110000101… |
… | …000001100111000001101000 |
3 | 201201122022001120110001120111 |
4 | 202031012011001213001220 |
5 | 124204200212100142440 |
6 | 1251540102244504104 |
7 | 43454313260252356 |
oct | 4215060501470150 |
9 | 651568046401514 |
10 | 150433461334120 |
11 | 43a295221491a8 |
12 | 14a570199ab034 |
13 | 65c2a786bb433 |
14 | 29210385dc7d6 |
15 | 125d1bd7724ea |
hex | 88d185067068 |
150433461334120 has 64 divisors (see below), whose sum is σ = 340205207328000. Its totient is φ = 59865894950400.
The previous prime is 150433461334081. The next prime is 150433461334171. The reversal of 150433461334120 is 21433164334051.
It is a Harshad number since it is a multiple of its sum of digits (40).
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 15 ways as a sum of consecutive naturals, for example, 93135237 + ... + 94736683.
It is an arithmetic number, because the mean of its divisors is an integer number (5315706364500).
Almost surely, 2150433461334120 is an apocalyptic number.
150433461334120 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
150433461334120 is an abundant number, since it is smaller than the sum of its proper divisors (189771745993880).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
150433461334120 is a wasteful number, since it uses less digits than its factorization.
150433461334120 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1613458 (or 1613454 counting only the distinct ones).
The product of its (nonzero) digits is 311040, while the sum is 40.
The spelling of 150433461334120 in words is "one hundred fifty trillion, four hundred thirty-three billion, four hundred sixty-one million, three hundred thirty-four thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •