Base | Representation |
---|---|
bin | 111101110000100010001… |
… | …011011001100011010101 |
3 | 120000201111201210222002101 |
4 | 331300202023121203111 |
5 | 1024013203240231122 |
6 | 13005400040242101 |
7 | 615422206104334 |
oct | 75604213314325 |
9 | 16021451728071 |
10 | 4244001102037 |
11 | 1396963a88004 |
12 | 586623470331 |
13 | 24a2910b6358 |
14 | 1095a714bd1b |
15 | 755e2308027 |
hex | 3dc222d98d5 |
4244001102037 has 2 divisors, whose sum is σ = 4244001102038. Its totient is φ = 4244001102036.
The previous prime is 4244001101993. The next prime is 4244001102053. The reversal of 4244001102037 is 7302011004424.
4244001102037 is digitally balanced in base 2, 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., 4034919881521 + 209081220516 = 2008711^2 + 457254^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-4244001102037 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 4244001101996 and 4244001102014.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (4244001102137) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2122000551018 + 2122000551019.
It is an arithmetic number, because the mean of its divisors is an integer number (2122000551019).
Almost surely, 24244001102037 is an apocalyptic number.
It is an amenable number.
4244001102037 is a deficient number, since it is larger than the sum of its proper divisors (1).
4244001102037 is an equidigital number, since it uses as much as digits as its factorization.
4244001102037 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5376, while the sum is 28.
The spelling of 4244001102037 in words is "four trillion, two hundred forty-four billion, one million, one hundred two thousand, thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •