Base | Representation |
---|---|
bin | 110000000111111001… |
… | …1100111011010101101 |
3 | 100212202020201200020202 |
4 | 1200033303213122231 |
5 | 3143122131413031 |
6 | 115250433123245 |
7 | 10315653640616 |
oct | 1401763473255 |
9 | 325666650222 |
10 | 103344404141 |
11 | 3a912249470 |
12 | 180419b9525 |
13 | 998c66b0c4 |
14 | 50052b8c0d |
15 | 2a4cb5e2cb |
hex | 180fce76ad |
103344404141 has 4 divisors (see below), whose sum is σ = 112739349984. Its totient is φ = 93949458300.
The previous prime is 103344404113. The next prime is 103344404203. The reversal of 103344404141 is 141404443301.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 103344404141 - 218 = 103344141997 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 (103344404341) 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, 4697472905 + ... + 4697472926.
It is an arithmetic number, because the mean of its divisors is an integer number (28184837496).
Almost surely, 2103344404141 is an apocalyptic number.
103344404141 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
103344404141 is a deficient number, since it is larger than the sum of its proper divisors (9394945843).
103344404141 is an equidigital number, since it uses as much as digits as its factorization.
103344404141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9394945842.
The product of its (nonzero) digits is 9216, while the sum is 29.
Adding to 103344404141 its reverse (141404443301), we get a palindrome (244748847442).
The spelling of 103344404141 in words is "one hundred three billion, three hundred forty-four million, four hundred four thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •