Base | Representation |
---|---|
bin | 1001110000000110100101… |
… | …10101100100110100011101 |
3 | 2210221000202012120020102222 |
4 | 10320003102311210310131 |
5 | 10302314320041021222 |
6 | 113335124413355125 |
7 | 4342164441352556 |
oct | 470032265446435 |
9 | 83830665506388 |
10 | 21444014001437 |
11 | 691839a950025 |
12 | 24a3bb0a98aa5 |
13 | bc7214754831 |
14 | 541c7819132d |
15 | 272c1c0bb542 |
hex | 1380d2d64d1d |
21444014001437 has 2 divisors, whose sum is σ = 21444014001438. Its totient is φ = 21444014001436.
The previous prime is 21444014001313. The next prime is 21444014001469. The reversal of 21444014001437 is 73410041044412.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 19239899641561 + 2204114359876 = 4386331^2 + 1484626^2 .
It is a cyclic number.
It is not a de Polignac number, because 21444014001437 - 218 = 21444013739293 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 21444014001397 and 21444014001406.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (21444014003437) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10722007000718 + 10722007000719.
It is an arithmetic number, because the mean of its divisors is an integer number (10722007000719).
Almost surely, 221444014001437 is an apocalyptic number.
It is an amenable number.
21444014001437 is a deficient number, since it is larger than the sum of its proper divisors (1).
21444014001437 is an equidigital number, since it uses as much as digits as its factorization.
21444014001437 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 43008, while the sum is 35.
Adding to 21444014001437 its reverse (73410041044412), we get a palindrome (94854055045849).
The spelling of 21444014001437 in words is "twenty-one trillion, four hundred forty-four billion, fourteen million, one thousand, four hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •