Base | Representation |
---|---|
bin | 11010010101110000… |
… | …11100000101101101 |
3 | 1100111112011221122011 |
4 | 31022320130011231 |
5 | 212430122222424 |
6 | 10255115121221 |
7 | 1010301211243 |
oct | 151270340555 |
9 | 40445157564 |
10 | 14141210989 |
11 | 5aa7388134 |
12 | 28a7a43211 |
13 | 1444951489 |
14 | 982154793 |
15 | 57b728694 |
hex | 34ae1c16d |
14141210989 has 2 divisors, whose sum is σ = 14141210990. Its totient is φ = 14141210988.
The previous prime is 14141210981. The next prime is 14141211013. The reversal of 14141210989 is 98901214141.
14141210989 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 12778493764 + 1362717225 = 113042^2 + 36915^2 .
It is a cyclic number.
It is not a de Polignac number, because 14141210989 - 23 = 14141210981 is a prime.
It is an alternating number because its digits alternate between odd and even.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (14141210981) 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 as a sum of consecutive naturals, namely, 7070605494 + 7070605495.
It is an arithmetic number, because the mean of its divisors is an integer number (7070605495).
Almost surely, 214141210989 is an apocalyptic number.
It is an amenable number.
14141210989 is a deficient number, since it is larger than the sum of its proper divisors (1).
14141210989 is an equidigital number, since it uses as much as digits as its factorization.
14141210989 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 20736, while the sum is 40.
The spelling of 14141210989 in words is "fourteen billion, one hundred forty-one million, two hundred ten thousand, nine hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •