Base | Representation |
---|---|
bin | 111101110000100010001… |
… | …011011010001010111001 |
3 | 120000201111201211002120011 |
4 | 331300202023122022321 |
5 | 1024013203240321234 |
6 | 13005400040301521 |
7 | 615422206114612 |
oct | 75604213321271 |
9 | 16021451732504 |
10 | 4244001104569 |
11 | 1396963a899a6 |
12 | 5866234718a1 |
13 | 24a2910b7555 |
14 | 1095a714cc09 |
15 | 755e2308b64 |
hex | 3dc222da2b9 |
4244001104569 has 2 divisors, whose sum is σ = 4244001104570. Its totient is φ = 4244001104568.
The previous prime is 4244001104537. The next prime is 4244001104573. The reversal of 4244001104569 is 9654011004424.
4244001104569 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., 3545640042169 + 698361062400 = 1882987^2 + 835680^2 .
It is a cyclic number.
It is not a de Polignac number, because 4244001104569 - 25 = 4244001104537 is a prime.
It is a super-2 number, since 2×42440011045692 (a number of 26 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (4244001104599) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2122000552284 + 2122000552285.
It is an arithmetic number, because the mean of its divisors is an integer number (2122000552285).
Almost surely, 24244001104569 is an apocalyptic number.
It is an amenable number.
4244001104569 is a deficient number, since it is larger than the sum of its proper divisors (1).
4244001104569 is an equidigital number, since it uses as much as digits as its factorization.
4244001104569 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 138240, while the sum is 40.
The spelling of 4244001104569 in words is "four trillion, two hundred forty-four billion, one million, one hundred four thousand, five hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •