Base | Representation |
---|---|
bin | 1100010001111… |
… | …01111011111101 |
3 | 21011211122211120 |
4 | 12020331323331 |
5 | 202332423031 |
6 | 14115541153 |
7 | 2360414526 |
oct | 610757375 |
9 | 234748746 |
10 | 103014141 |
11 | 5317005a |
12 | 2a5ba7b9 |
13 | 1845a719 |
14 | d97784d |
15 | 909ca96 |
hex | 623defd |
103014141 has 8 divisors (see below), whose sum is σ = 138043200. Its totient is φ = 68330592.
The previous prime is 103014133. The next prime is 103014161. The reversal of 103014141 is 141410301.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 103014141 - 23 = 103014133 is a prime.
It is a super-2 number, since 2×1030141412 = 21223826491935762, which contains 22 as substring.
It is an alternating number because its digits alternate between odd and even.
It is a self number, because there is not a number n which added to its sum of digits gives 103014141.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (103014161) 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, 85680 + ... + 86873.
It is an arithmetic number, because the mean of its divisors is an integer number (17255400).
Almost surely, 2103014141 is an apocalyptic number.
It is an amenable number.
103014141 is a deficient number, since it is larger than the sum of its proper divisors (35029059).
103014141 is a wasteful number, since it uses less digits than its factorization.
103014141 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 172755.
The product of its (nonzero) digits is 48, while the sum is 15.
The square root of 103014141 is about 10149.5882182481. The cubic root of 103014141 is about 468.7762657638.
Adding to 103014141 its reverse (141410301), we get a palindrome (244424442).
The spelling of 103014141 in words is "one hundred three million, fourteen thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •