Base | Representation |
---|---|
bin | 110000001110010111… |
… | …0101101110110111011 |
3 | 100220022100201020122111 |
4 | 1200130232231312323 |
5 | 3144043133123421 |
6 | 115324140233151 |
7 | 10324225606426 |
oct | 1403456556673 |
9 | 326270636574 |
10 | 103561223611 |
11 | 3aa1367a10a |
12 | 180a253b7b7 |
13 | 99c5563c51 |
14 | 5025dd89bd |
15 | 2a61bdbee1 |
hex | 181cbaddbb |
103561223611 has 4 divisors (see below), whose sum is σ = 109653060312. Its totient is φ = 97469386912.
The previous prime is 103561223609. The next prime is 103561223651. The reversal of 103561223611 is 116322165301.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 116322165301 = 137993 ⋅842957.
It is a cyclic number.
It is not a de Polignac number, because 103561223611 - 21 = 103561223609 is a prime.
It is a super-3 number, since 3×1035612236113 (a number of 34 digits) contains 333 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (103561223651) 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, 3045918325 + ... + 3045918358.
It is an arithmetic number, because the mean of its divisors is an integer number (27413265078).
Almost surely, 2103561223611 is an apocalyptic number.
103561223611 is a deficient number, since it is larger than the sum of its proper divisors (6091836701).
103561223611 is an equidigital number, since it uses as much as digits as its factorization.
103561223611 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6091836700.
The product of its (nonzero) digits is 6480, while the sum is 31.
Adding to 103561223611 its reverse (116322165301), we get a palindrome (219883388912).
The spelling of 103561223611 in words is "one hundred three billion, five hundred sixty-one million, two hundred twenty-three thousand, six hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •