Base | Representation |
---|---|
bin | 10000000011010110100… |
… | …100001010010011111101 |
3 | 10220110022201202212020112 |
4 | 100003112210022103331 |
5 | 121033133011301141 |
6 | 2202432402155405 |
7 | 142461062313116 |
oct | 20032644122375 |
9 | 3813281685215 |
10 | 1103111431421 |
11 | 39591071051a |
12 | 159959952b65 |
13 | 8003b5a655c |
14 | 3b5687d920d |
15 | 1da63c067eb |
hex | 100d690a4fd |
1103111431421 has 4 divisors (see below), whose sum is σ = 1103113757244. Its totient is φ = 1103109105600.
The previous prime is 1103111431399. The next prime is 1103111431447. The reversal of 1103111431421 is 1241341113011.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 208931268100 + 894180163321 = 457090^2 + 945611^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1103111431421 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1103111431451) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 167420 + ... + 1494741.
It is an arithmetic number, because the mean of its divisors is an integer number (275778439311).
Almost surely, 21103111431421 is an apocalyptic number.
It is an amenable number.
1103111431421 is a deficient number, since it is larger than the sum of its proper divisors (2325823).
1103111431421 is an equidigital number, since it uses as much as digits as its factorization.
1103111431421 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2325822.
The product of its (nonzero) digits is 288, while the sum is 23.
Adding to 1103111431421 its reverse (1241341113011), we get a palindrome (2344452544432).
The spelling of 1103111431421 in words is "one trillion, one hundred three billion, one hundred eleven million, four hundred thirty-one thousand, four hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •