Base | Representation |
---|---|
bin | 110000000100100111… |
… | …0111101010011000101 |
3 | 100212110120020020010120 |
4 | 1200021032331103011 |
5 | 3142410414144031 |
6 | 115231453412153 |
7 | 10313144431161 |
oct | 1401116752305 |
9 | 325416206116 |
10 | 103234131141 |
11 | 3a865a80759 |
12 | 18010a9a059 |
13 | 997286b6cb |
14 | 4dd47b1ca1 |
15 | 2a4312aa96 |
hex | 18093bd4c5 |
103234131141 has 4 divisors (see below), whose sum is σ = 137645508192. Its totient is φ = 68822754092.
The previous prime is 103234131139. The next prime is 103234131151. The reversal of 103234131141 is 141131432301.
It is a happy number.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 103234131141 - 21 = 103234131139 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (103234131101) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 17205688521 + ... + 17205688526.
It is an arithmetic number, because the mean of its divisors is an integer number (34411377048).
Almost surely, 2103234131141 is an apocalyptic number.
It is an amenable number.
103234131141 is a deficient number, since it is larger than the sum of its proper divisors (34411377051).
103234131141 is an equidigital number, since it uses as much as digits as its factorization.
103234131141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 34411377050.
The product of its (nonzero) digits is 864, while the sum is 24.
Adding to 103234131141 its reverse (141131432301), we get a palindrome (244365563442).
The spelling of 103234131141 in words is "one hundred three billion, two hundred thirty-four million, one hundred thirty-one thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •