Base | Representation |
---|---|
bin | 1100010010100… |
… | …11001011010101 |
3 | 21012000002011210 |
4 | 12021103023111 |
5 | 202343214031 |
6 | 14121452033 |
7 | 2361226263 |
oct | 611231325 |
9 | 235002153 |
10 | 103101141 |
11 | 5321a460 |
12 | 2a641019 |
13 | 1848b1c0 |
14 | d99b433 |
15 | 90b8746 |
hex | 62532d5 |
103101141 has 64 divisors (see below), whose sum is σ = 174375936. Its totient is φ = 53222400.
The previous prime is 103101121. The next prime is 103101161. The reversal of 103101141 is 141101301.
103101141 = T450 + T451 + ... + T891.
It is an interprime number because it is at equal distance from previous prime (103101121) and next prime (103101161).
It is not a de Polignac number, because 103101141 - 25 = 103101109 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (103101121) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 488526 + ... + 488736.
It is an arithmetic number, because the mean of its divisors is an integer number (2724624).
Almost surely, 2103101141 is an apocalyptic number.
103101141 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
103101141 is a deficient number, since it is larger than the sum of its proper divisors (71274795).
103101141 is a wasteful number, since it uses less digits than its factorization.
103101141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 322.
The product of its (nonzero) digits is 12, while the sum is 12.
The square root of 103101141 is about 10153.8732018871. The cubic root of 103101141 is about 468.9081960630.
Adding to 103101141 its reverse (141101301), we get a palindrome (244202442).
The spelling of 103101141 in words is "one hundred three million, one hundred one thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •