Base | Representation |
---|---|
bin | 111101110000100010001… |
… | …100100010110110111101 |
3 | 120000201111202101012222021 |
4 | 331300202030202312331 |
5 | 1024013203324333201 |
6 | 13005400050520141 |
7 | 615422211464623 |
oct | 75604214426675 |
9 | 16021452335867 |
10 | 4244001402301 |
11 | 1396964172661 |
12 | 586623596051 |
13 | 24a29118cc1b |
14 | 1095a71c9513 |
15 | 755e2366ea1 |
hex | 3dc22322dbd |
4244001402301 has 2 divisors, whose sum is σ = 4244001402302. Its totient is φ = 4244001402300.
The previous prime is 4244001402281. The next prime is 4244001402307. The reversal of 4244001402301 is 1032041004424.
4244001402301 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2782741104025 + 1461260298276 = 1668155^2 + 1208826^2 .
It is a cyclic number.
It is not a de Polignac number, because 4244001402301 - 213 = 4244001394109 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (4244001402307) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2122000701150 + 2122000701151.
It is an arithmetic number, because the mean of its divisors is an integer number (2122000701151).
Almost surely, 24244001402301 is an apocalyptic number.
It is an amenable number.
4244001402301 is a deficient number, since it is larger than the sum of its proper divisors (1).
4244001402301 is an equidigital number, since it uses as much as digits as its factorization.
4244001402301 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 3072, while the sum is 25.
Adding to 4244001402301 its reverse (1032041004424), we get a palindrome (5276042406725).
The spelling of 4244001402301 in words is "four trillion, two hundred forty-four billion, one million, four hundred two thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •