Base | Representation |
---|---|
bin | 10000000011100010100… |
… | …001010100011101010101 |
3 | 10220110211201012110122010 |
4 | 100003202201110131111 |
5 | 121034040333410031 |
6 | 2202504325254433 |
7 | 142466046242352 |
oct | 20034241243525 |
9 | 3813751173563 |
10 | 1103312013141 |
11 | 395a03960538 |
12 | 1599b4b64419 |
13 | 80071005570 |
14 | 3b5872cd629 |
15 | 1da76628246 |
hex | 100e2854755 |
1103312013141 has 48 divisors (see below), whose sum is σ = 1630319140800. Its totient is φ = 659752320000.
The previous prime is 1103312013113. The next prime is 1103312013179. The reversal of 1103312013141 is 1413102133011.
It is not a de Polignac number, because 1103312013141 - 229 = 1102775142229 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1103312063141) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 16421785 + ... + 16488833.
It is an arithmetic number, because the mean of its divisors is an integer number (33964982100).
Almost surely, 21103312013141 is an apocalyptic number.
It is an amenable number.
1103312013141 is a deficient number, since it is larger than the sum of its proper divisors (527007127659).
1103312013141 is a wasteful number, since it uses less digits than its factorization.
1103312013141 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 67398 (or 67357 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 21.
Adding to 1103312013141 its reverse (1413102133011), we get a palindrome (2516414146152).
The spelling of 1103312013141 in words is "one trillion, one hundred three billion, three hundred twelve million, thirteen thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •