Base | Representation |
---|---|
bin | 110000000001110110… |
… | …0001110111110011111 |
3 | 100212020002020220121021 |
4 | 1200003230032332133 |
5 | 3142213113024211 |
6 | 115214332345011 |
7 | 10310635150105 |
oct | 1400354167637 |
9 | 325202226537 |
10 | 103141142431 |
11 | 3a818538988 |
12 | 17ba5915167 |
13 | 99595112c2 |
14 | 4dc62c7c75 |
15 | 2a39dad771 |
hex | 1803b0ef9f |
103141142431 has 8 divisors (see below), whose sum is σ = 107629004160. Its totient is φ = 98653569432.
The previous prime is 103141142411. The next prime is 103141142441. The reversal of 103141142431 is 134241141301.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 103141142431 - 29 = 103141141919 is a prime.
It is a super-2 number, since 2×1031411424312 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 103141142396 and 103141142405.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (103141142411) 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, 991416 + ... + 1090498.
It is an arithmetic number, because the mean of its divisors is an integer number (13453625520).
Almost surely, 2103141142431 is an apocalyptic number.
103141142431 is a deficient number, since it is larger than the sum of its proper divisors (4487861729).
103141142431 is an equidigital number, since it uses as much as digits as its factorization.
103141142431 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 144365.
The product of its (nonzero) digits is 1152, while the sum is 25.
Adding to 103141142431 its reverse (134241141301), we get a palindrome (237382283732).
The spelling of 103141142431 in words is "one hundred three billion, one hundred forty-one million, one hundred forty-two thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •