Base | Representation |
---|---|
bin | 110000001001111100… |
… | …1101011111000001101 |
3 | 100212221000222222221012 |
4 | 1200103321223320031 |
5 | 3143242223313031 |
6 | 115301325415005 |
7 | 10320446611304 |
oct | 1402371537015 |
9 | 325830888835 |
10 | 103413104141 |
11 | 3a948001826 |
12 | 18060a0a465 |
13 | 99a0972ca9 |
14 | 501047d43b |
15 | 2a53bceb2b |
hex | 1813e6be0d |
103413104141 has 8 divisors (see below), whose sum is σ = 109566132480. Its totient is φ = 97267843008.
The previous prime is 103413104029. The next prime is 103413104191. The reversal of 103413104141 is 141401314301.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a de Polignac number, because none of the positive numbers 2k-103413104141 is a prime.
It is a super-2 number, since 2×1034131041412 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (103413104191) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1914371 + ... + 1967648.
It is an arithmetic number, because the mean of its divisors is an integer number (13695766560).
Almost surely, 2103413104141 is an apocalyptic number.
It is an amenable number.
103413104141 is a deficient number, since it is larger than the sum of its proper divisors (6153028339).
103413104141 is a wasteful number, since it uses less digits than its factorization.
103413104141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3883603.
The product of its (nonzero) digits is 576, while the sum is 23.
Adding to 103413104141 its reverse (141401314301), we get a palindrome (244814418442).
The spelling of 103413104141 in words is "one hundred three billion, four hundred thirteen million, one hundred four thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •