Base | Representation |
---|---|
bin | 10000000011010000101… |
… | …001101011000110001011 |
3 | 10220110001211002001100001 |
4 | 100003100221223012023 |
5 | 121032432111310011 |
6 | 2202414455423431 |
7 | 142455446055013 |
oct | 20032051530613 |
9 | 3813054061301 |
10 | 1103012213131 |
11 | 39586a703334 |
12 | 159930684b77 |
13 | 80023b777ca |
14 | 3b55956cc43 |
15 | 1da5a1587c1 |
hex | 100d0a6b18b |
1103012213131 has 8 divisors (see below), whose sum is σ = 1128740659200. Its totient is φ = 1077287267112.
The previous prime is 1103012213077. The next prime is 1103012213141. The reversal of 1103012213131 is 1313122103011.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1103012213131 - 29 = 1103012212619 is a prime.
It is a super-2 number, since 2×11030122131312 (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 = 1103012213099 and 1103012213108.
It is not an unprimeable number, because it can be changed into a prime (1103012213141) 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, 231931 + ... + 1503268.
It is an arithmetic number, because the mean of its divisors is an integer number (141092582400).
Almost surely, 21103012213131 is an apocalyptic number.
1103012213131 is a deficient number, since it is larger than the sum of its proper divisors (25728446069).
1103012213131 is a wasteful number, since it uses less digits than its factorization.
1103012213131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1750025.
The product of its (nonzero) digits is 108, while the sum is 19.
Adding to 1103012213131 its reverse (1313122103011), we get a palindrome (2416134316142).
The spelling of 1103012213131 in words is "one trillion, one hundred three billion, twelve million, two hundred thirteen thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •