Base | Representation |
---|---|
bin | 110011010010101110… |
… | …0111011000111010000 |
3 | 101112022112200000211020 |
4 | 1212211130323013100 |
5 | 3301041400131300 |
6 | 122334024515440 |
7 | 10646422411254 |
oct | 1464534730720 |
9 | 345275600736 |
10 | 110150005200 |
11 | 42794896254 |
12 | 1942101bb80 |
13 | a5055cb291 |
14 | 548d0b0264 |
15 | 2cea3788a0 |
hex | 19a573b1d0 |
110150005200 has 60 divisors (see below), whose sum is σ = 352847187168. Its totient is φ = 29373334400.
The previous prime is 110150005171. The next prime is 110150005291. The reversal of 110150005200 is 2500051011.
It is a tau number, because it is divible by the number of its divisors (60).
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a self number, because there is not a number n which added to its sum of digits gives 110150005200.
It is a congruent number.
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 11 ways as a sum of consecutive naturals, for example, 45894636 + ... + 45897035.
Almost surely, 2110150005200 is an apocalyptic number.
110150005200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
110150005200 is an abundant number, since it is smaller than the sum of its proper divisors (242697181968).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
110150005200 is a wasteful number, since it uses less digits than its factorization.
110150005200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 91791692 (or 91791681 counting only the distinct ones).
The product of its (nonzero) digits is 50, while the sum is 15.
Adding to 110150005200 its reverse (2500051011), we get a palindrome (112650056211).
The spelling of 110150005200 in words is "one hundred ten billion, one hundred fifty million, five thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •