Base | Representation |
---|---|
bin | 1100011110011001111… |
… | …0010011111011100101 |
3 | 202111012100002022000211 |
4 | 3013212132103323211 |
5 | 12002411421300031 |
6 | 242242435335421 |
7 | 21325023550564 |
oct | 3074636237345 |
9 | 674170068024 |
10 | 214320103141 |
11 | 82990124691 |
12 | 35653451571 |
13 | 172970471a1 |
14 | a531cc1bdb |
15 | 5895737bb1 |
hex | 31e6793ee5 |
214320103141 has 2 divisors, whose sum is σ = 214320103142. Its totient is φ = 214320103140.
The previous prime is 214320103133. The next prime is 214320103169. The reversal of 214320103141 is 141301023412.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 108014109025 + 106305994116 = 328655^2 + 326046^2 .
It is a cyclic number.
It is not a de Polignac number, because 214320103141 - 23 = 214320103133 is a prime.
It is a super-2 number, since 2×2143201031412 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (214320103241) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 107160051570 + 107160051571.
It is an arithmetic number, because the mean of its divisors is an integer number (107160051571).
Almost surely, 2214320103141 is an apocalyptic number.
It is an amenable number.
214320103141 is a deficient number, since it is larger than the sum of its proper divisors (1).
214320103141 is an equidigital number, since it uses as much as digits as its factorization.
214320103141 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 576, while the sum is 22.
Adding to 214320103141 its reverse (141301023412), we get a palindrome (355621126553).
The spelling of 214320103141 in words is "two hundred fourteen billion, three hundred twenty million, one hundred three thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •