Base | Representation |
---|---|
bin | 110000000100000001… |
… | …0010100110000011101 |
3 | 100212102011102121012112 |
4 | 1200020002110300131 |
5 | 3142340243322031 |
6 | 115225455043405 |
7 | 10312511611520 |
oct | 1401002246035 |
9 | 325364377175 |
10 | 103214042141 |
11 | 3a8556aa581 |
12 | 18006210565 |
13 | 996b656922 |
14 | 4dd1c62bb7 |
15 | 2a414ad62b |
hex | 1808094c1d |
103214042141 has 4 divisors (see below), whose sum is σ = 117958905312. Its totient is φ = 88469178972.
The previous prime is 103214042047. The next prime is 103214042143. The reversal of 103214042141 is 141240412301.
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, and also an emirpimes, since its reverse is a distinct semiprime: 141240412301 = 27407 ⋅5153443.
It is a cyclic number.
It is not a de Polignac number, because 103214042141 - 218 = 103213779997 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (103214042143) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 7372431575 + ... + 7372431588.
It is an arithmetic number, because the mean of its divisors is an integer number (29489726328).
Almost surely, 2103214042141 is an apocalyptic number.
It is an amenable number.
103214042141 is a deficient number, since it is larger than the sum of its proper divisors (14744863171).
103214042141 is an equidigital number, since it uses as much as digits as its factorization.
103214042141 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 14744863170.
The product of its (nonzero) digits is 768, while the sum is 23.
Adding to 103214042141 its reverse (141240412301), we get a palindrome (244454454442).
The spelling of 103214042141 in words is "one hundred three billion, two hundred fourteen million, forty-two thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •