Base | Representation |
---|---|
bin | 110011011110011110… |
… | …1100101111001010011 |
3 | 101120100000212122112010 |
4 | 1212330331211321103 |
5 | 3302343334220021 |
6 | 122441115034003 |
7 | 10662252164460 |
oct | 1467475457123 |
9 | 346300778463 |
10 | 110544445011 |
11 | 42977503770 |
12 | 1951113b903 |
13 | a569243b10 |
14 | 54c9628667 |
15 | 2d1ecde976 |
hex | 19bcf65e53 |
110544445011 has 64 divisors (see below), whose sum is σ = 203246539776. Its totient is φ = 51575616000.
The previous prime is 110544445001. The next prime is 110544445013.
110544445011 is nontrivially palindromic in base 10.
It is not a de Polignac number, because 110544445011 - 25 = 110544444979 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 110544445011.
It is not an unprimeable number, because it can be changed into a prime (110544445013) 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 63 ways as a sum of consecutive naturals, for example, 386340 + ... + 608561.
It is an arithmetic number, because the mean of its divisors is an integer number (3175727184).
Almost surely, 2110544445011 is an apocalyptic number.
110544445011 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
110544445011 is a deficient number, since it is larger than the sum of its proper divisors (92702094765).
110544445011 is a wasteful number, since it uses less digits than its factorization.
110544445011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 994972.
The product of its (nonzero) digits is 6400, while the sum is 30.
It can be divided in two parts, 110544 and 445011, that added together give a palindrome (555555).
The spelling of 110544445011 in words is "one hundred ten billion, five hundred forty-four million, four hundred forty-five thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •