Base | Representation |
---|---|
bin | 101111111101111110… |
… | …0001101100101101001 |
3 | 100211220000120202012022 |
4 | 1133323330031211221 |
5 | 3141431321111241 |
6 | 115153405354225 |
7 | 10304466005354 |
oct | 1377374154551 |
9 | 324800522168 |
10 | 103011113321 |
11 | 3a7610a7106 |
12 | 17b6a268975 |
13 | 99385b54bc |
14 | 4db2d1b29b |
15 | 2a2d77654b |
hex | 17fbf0d969 |
103011113321 has 8 divisors (see below), whose sum is σ = 104469041088. Its totient is φ = 101553382000.
The previous prime is 103011113273. The next prime is 103011113347. The reversal of 103011113321 is 123311110301.
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 103011113321 - 234 = 85831244137 is a prime.
It is a super-2 number, since 2×1030111133212 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 103011113321.
It is not an unprimeable number, because it can be changed into a prime (103011113921) 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, 1247291 + ... + 1327311.
It is an arithmetic number, because the mean of its divisors is an integer number (13058630136).
Almost surely, 2103011113321 is an apocalyptic number.
It is an amenable number.
103011113321 is a deficient number, since it is larger than the sum of its proper divisors (1457927767).
103011113321 is an equidigital number, since it uses as much as digits as its factorization.
103011113321 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 98223.
The product of its (nonzero) digits is 54, while the sum is 17.
Adding to 103011113321 its reverse (123311110301), we get a palindrome (226322223622).
The spelling of 103011113321 in words is "one hundred three billion, eleven million, one hundred thirteen thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •