Base | Representation |
---|---|
bin | 1101001000100110100010… |
… | …0011101101011111111101 |
3 | 1220010120212101022212001122 |
4 | 3102021220203231133331 |
5 | 3343102024131203041 |
6 | 50414145302520325 |
7 | 3020234126446064 |
oct | 322115043553775 |
9 | 56116771285048 |
10 | 14441434241021 |
11 | 466863a161587 |
12 | 1752a1b1360a5 |
13 | 809a8a821768 |
14 | 37cd7d4a51db |
15 | 1a09c5188c4b |
hex | d22688ed7fd |
14441434241021 has 2 divisors, whose sum is σ = 14441434241022. Its totient is φ = 14441434241020.
The previous prime is 14441434240997. The next prime is 14441434241023. The reversal of 14441434241021 is 12014243414441.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 12196648216900 + 2244786024121 = 3492370^2 + 1498261^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-14441434241021 is a prime.
Together with 14441434241023, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (14441434241023) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 7220717120510 + 7220717120511.
It is an arithmetic number, because the mean of its divisors is an integer number (7220717120511).
Almost surely, 214441434241021 is an apocalyptic number.
It is an amenable number.
14441434241021 is a deficient number, since it is larger than the sum of its proper divisors (1).
14441434241021 is an equidigital number, since it uses as much as digits as its factorization.
14441434241021 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 49152, while the sum is 35.
Adding to 14441434241021 its reverse (12014243414441), we get a palindrome (26455677655462).
The spelling of 14441434241021 in words is "fourteen trillion, four hundred forty-one billion, four hundred thirty-four million, two hundred forty-one thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •