Base | Representation |
---|---|
bin | 10000000011101001101… |
… | …000110101100011011101 |
3 | 10220111011000220011211201 |
4 | 100003221220311203131 |
5 | 121034311421033341 |
6 | 2202524232515501 |
7 | 142502026231540 |
oct | 20035150654335 |
9 | 3814130804751 |
10 | 1103431424221 |
11 | 395a652aa885 |
12 | 159a28b4bb91 |
13 | 8008c9843c9 |
14 | 3b5990d4857 |
15 | 1da81d64331 |
hex | 100e9a358dd |
1103431424221 has 16 divisors (see below), whose sum is σ = 1274160469120. Its totient is φ = 935977835520.
The previous prime is 1103431424209. The next prime is 1103431424231. The reversal of 1103431424221 is 1224241343011.
It is a happy number.
It is not a de Polignac number, because 1103431424221 - 211 = 1103431422173 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1103431424221.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1103431424231) by changing a digit.
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 15 ways as a sum of consecutive naturals, for example, 10328086 + ... + 10434376.
It is an arithmetic number, because the mean of its divisors is an integer number (79635029320).
Almost surely, 21103431424221 is an apocalyptic number.
It is an amenable number.
1103431424221 is a deficient number, since it is larger than the sum of its proper divisors (170729044899).
1103431424221 is a wasteful number, since it uses less digits than its factorization.
1103431424221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 121684.
The product of its (nonzero) digits is 4608, while the sum is 28.
Adding to 1103431424221 its reverse (1224241343011), we get a palindrome (2327672767232).
The spelling of 1103431424221 in words is "one trillion, one hundred three billion, four hundred thirty-one million, four hundred twenty-four thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •