Base | Representation |
---|---|
bin | 110011010100001111… |
… | …1111011000100111100 |
3 | 101112110002212002102222 |
4 | 1212220133323010330 |
5 | 3301142441420012 |
6 | 122343052304512 |
7 | 10650613043162 |
oct | 1465037730474 |
9 | 345402762388 |
10 | 110201123132 |
11 | 4281072a981 |
12 | 19436172138 |
13 | a513088489 |
14 | 5495bb9232 |
15 | 2ceeac4972 |
hex | 19a87fb13c |
110201123132 has 12 divisors (see below), whose sum is σ = 192854898600. Its totient is φ = 55099723536.
The previous prime is 110201123101. The next prime is 110201123143. The reversal of 110201123132 is 231321102011.
It is a self number, because there is not a number n which added to its sum of digits gives 110201123132.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 157994 + ... + 495342.
It is an arithmetic number, because the mean of its divisors is an integer number (16071241550).
Almost surely, 2110201123132 is an apocalyptic number.
It is an amenable number.
110201123132 is a deficient number, since it is larger than the sum of its proper divisors (82653775468).
110201123132 is a wasteful number, since it uses less digits than its factorization.
110201123132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 419020 (or 419018 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 17.
Adding to 110201123132 its reverse (231321102011), we get a palindrome (341522225143).
The spelling of 110201123132 in words is "one hundred ten billion, two hundred one million, one hundred twenty-three thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •