Base | Representation |
---|---|
bin | 1000110000110010010… |
… | …1111000100111110000 |
3 | 112101120001101002011222 |
4 | 2030030211320213300 |
5 | 4431243442110300 |
6 | 153053241524212 |
7 | 13606254231023 |
oct | 2141445704760 |
9 | 471501332158 |
10 | 150535113200 |
11 | 5892916866a |
12 | 25211aa3668 |
13 | 112703a99a4 |
14 | 74008871ba |
15 | 3db0a81785 |
hex | 230c9789f0 |
150535113200 has 30 divisors (see below), whose sum is σ = 361660610424. Its totient is φ = 60214045120.
The previous prime is 150535113191. The next prime is 150535113233. The reversal of 150535113200 is 2311535051.
It is a happy number.
It is a super-2 number, since 2×1505351132002 (a number of 23 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 150535113200.
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 5 ways as a sum of consecutive naturals, for example, 188168492 + ... + 188169291.
Almost surely, 2150535113200 is an apocalyptic number.
150535113200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
150535113200 is an abundant number, since it is smaller than the sum of its proper divisors (211125497224).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
150535113200 is a wasteful number, since it uses less digits than its factorization.
150535113200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 376337801 (or 376337790 counting only the distinct ones).
The product of its (nonzero) digits is 2250, while the sum is 26.
Adding to 150535113200 its reverse (2311535051), we get a palindrome (152846648251).
The spelling of 150535113200 in words is "one hundred fifty billion, five hundred thirty-five million, one hundred thirteen thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •