Base | Representation |
---|---|
bin | 11001000010110011101000… |
… | …101101011000101001111001 |
3 | 112102222200000220122220102220 |
4 | 121002303220231120221321 |
5 | 103414100001130101301 |
6 | 1030131250451514253 |
7 | 32125434061505055 |
oct | 3102635055305171 |
9 | 472880026586386 |
10 | 110144045550201 |
11 | 3210591129a053 |
12 | 1042a7a1bb8989 |
13 | 495c701042a30 |
14 | 1d2b00097cc65 |
15 | cb01756a5936 |
hex | 642ce8b58a79 |
110144045550201 has 32 divisors (see below), whose sum is σ = 167470735557888. Its totient is φ = 63789297223680.
The previous prime is 110144045550179. The next prime is 110144045550229. The reversal of 110144045550201 is 102055540441011.
It is not a de Polignac number, because 110144045550201 - 210 = 110144045549177 is a prime.
It is a super-2 number, since 2×1101440455502012 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (110144045550281) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 3425805 + ... + 15232341.
It is an arithmetic number, because the mean of its divisors is an integer number (5233460486184).
Almost surely, 2110144045550201 is an apocalyptic number.
It is an amenable number.
110144045550201 is a deficient number, since it is larger than the sum of its proper divisors (57326690007687).
110144045550201 is a wasteful number, since it uses less digits than its factorization.
110144045550201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11820641.
The product of its (nonzero) digits is 16000, while the sum is 33.
Adding to 110144045550201 its reverse (102055540441011), we get a palindrome (212199585991212).
The spelling of 110144045550201 in words is "one hundred ten trillion, one hundred forty-four billion, forty-five million, five hundred fifty thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •