Base | Representation |
---|---|
bin | 1000110000110100110… |
… | …0000001110010001000 |
3 | 112101120202012002020022 |
4 | 2030031030001302020 |
5 | 4431304022042300 |
6 | 153054240120012 |
7 | 13606435224440 |
oct | 2141514016210 |
9 | 471522162208 |
10 | 150545112200 |
11 | 58933877aaa |
12 | 25215306008 |
13 | 1127249ac62 |
14 | 7401d2b120 |
15 | 3db18a9285 |
hex | 230d301c88 |
150545112200 has 48 divisors (see below), whose sum is σ = 400019873280. Its totient is φ = 51615466560.
The previous prime is 150545112173. The next prime is 150545112241. The reversal of 150545112200 is 2211545051.
It is a self number, because there is not a number n which added to its sum of digits gives 150545112200.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 53764712 + ... + 53767511.
It is an arithmetic number, because the mean of its divisors is an integer number (8333747360).
Almost surely, 2150545112200 is an apocalyptic number.
150545112200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
150545112200 is an abundant number, since it is smaller than the sum of its proper divisors (249474761080).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
150545112200 is a wasteful number, since it uses less digits than its factorization.
150545112200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 107532246 (or 107532237 counting only the distinct ones).
The product of its (nonzero) digits is 2000, while the sum is 26.
Adding to 150545112200 its reverse (2211545051), we get a palindrome (152756657251).
The spelling of 150545112200 in words is "one hundred fifty billion, five hundred forty-five million, one hundred twelve thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •