Base | Representation |
---|---|
bin | 110000000111011111… |
… | …0001111011001101101 |
3 | 100212201021101210211112 |
4 | 1200032332033121231 |
5 | 3143110041142031 |
6 | 115245213201405 |
7 | 10315424003615 |
oct | 1401676173155 |
9 | 325637353745 |
10 | 103330412141 |
11 | 3a905362030 |
12 | 18039190265 |
13 | 99897ac508 |
14 | 50034b5a45 |
15 | 2a4b7e862b |
hex | 180ef8f66d |
103330412141 has 8 divisors (see below), whose sum is σ = 112732001184. Its totient is φ = 93930142320.
The previous prime is 103330412089. The next prime is 103330412173. The reversal of 103330412141 is 141214033301.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-103330412141 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (103330415141) 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, 162326 + ... + 482711.
It is an arithmetic number, because the mean of its divisors is an integer number (14091500148).
Almost surely, 2103330412141 is an apocalyptic number.
103330412141 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
103330412141 is a deficient number, since it is larger than the sum of its proper divisors (9401589043).
103330412141 is a wasteful number, since it uses less digits than its factorization.
103330412141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 659611.
The product of its (nonzero) digits is 864, while the sum is 23.
Adding to 103330412141 its reverse (141214033301), we get a palindrome (244544445442).
The spelling of 103330412141 in words is "one hundred three billion, three hundred thirty million, four hundred twelve thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •