Base | Representation |
---|---|
bin | 10000000100000001011… |
… | …110100111001100010101 |
3 | 10220112011220111220112120 |
4 | 100010001132213030111 |
5 | 121041121314202031 |
6 | 2203032041410153 |
7 | 142514654031414 |
oct | 20040136471425 |
9 | 3815156456476 |
10 | 1103831397141 |
11 | 396150057410 |
12 | 159b1aa99959 |
13 | 801247b6585 |
14 | 3b5d628d47b |
15 | 1daa701ea96 |
hex | 101017a7315 |
1103831397141 has 8 divisors (see below), whose sum is σ = 1605572941344. Its totient is φ = 668988725520.
The previous prime is 1103831397029. The next prime is 1103831397209. The reversal of 1103831397141 is 1417931383011.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1103831397141 - 227 = 1103697179413 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1103831397093 and 1103831397102.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1103831357141) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 16724718106 + ... + 16724718171.
It is an arithmetic number, because the mean of its divisors is an integer number (200696617668).
Almost surely, 21103831397141 is an apocalyptic number.
1103831397141 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
1103831397141 is a deficient number, since it is larger than the sum of its proper divisors (501741544203).
1103831397141 is a wasteful number, since it uses less digits than its factorization.
1103831397141 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 33449436291.
The product of its (nonzero) digits is 54432, while the sum is 42.
The spelling of 1103831397141 in words is "one trillion, one hundred three billion, eight hundred thirty-one million, three hundred ninety-seven thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •