Base | Representation |
---|---|
bin | 10000000011100111110… |
… | …010001011110101001011 |
3 | 10220111001212100221022210 |
4 | 100003213302023311023 |
5 | 121034230440222311 |
6 | 2202521202120203 |
7 | 142501200654621 |
oct | 20034762136513 |
9 | 3814055327283 |
10 | 1103400320331 |
11 | 395a49795a91 |
12 | 159a1a650063 |
13 | 800863b3b3a |
14 | 3b594d19511 |
15 | 1da7e26d3a6 |
hex | 100e7c8bd4b |
1103400320331 has 4 divisors (see below), whose sum is σ = 1471200427112. Its totient is φ = 735600213552.
The previous prime is 1103400320291. The next prime is 1103400320359. The reversal of 1103400320331 is 1330230043011.
It is a semiprime because it is the product of two primes.
It is not a de Polignac number, because 1103400320331 - 27 = 1103400320203 is a prime.
It is a super-2 number, since 2×11034003203312 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1103400320298 and 1103400320307.
It is not an unprimeable number, because it can be changed into a prime (1103400360331) 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, 183900053386 + ... + 183900053391.
It is an arithmetic number, because the mean of its divisors is an integer number (367800106778).
Almost surely, 21103400320331 is an apocalyptic number.
1103400320331 is a deficient number, since it is larger than the sum of its proper divisors (367800106781).
1103400320331 is an equidigital number, since it uses as much as digits as its factorization.
1103400320331 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 367800106780.
The product of its (nonzero) digits is 648, while the sum is 21.
Adding to 1103400320331 its reverse (1330230043011), we get a palindrome (2433630363342).
The spelling of 1103400320331 in words is "one trillion, one hundred three billion, four hundred million, three hundred twenty thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •