Base | Representation |
---|---|
bin | 1101011010111100000101000… |
… | …1110011110010101110010001 |
3 | 11120211220000101121201210020202 |
4 | 3112233001101303302232101 |
5 | 1442241231103134030244 |
6 | 13144333224015144545 |
7 | 402632412021262262 |
oct | 32657012163625621 |
9 | 4524800347653222 |
10 | 944413141314449 |
11 | 253a12400521554 |
12 | 89b09716215155 |
13 | 316c7a14362361 |
14 | 1292dba8ab4969 |
15 | 742b546b6504e |
hex | 35af051cf2b91 |
944413141314449 has 2 divisors, whose sum is σ = 944413141314450. Its totient is φ = 944413141314448.
The previous prime is 944413141314443. The next prime is 944413141314457.
944413141314449 is nontrivially palindromic in base 10.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 913391527527424 + 31021613787025 = 30222368^2 + 5569705^2 .
It is a palprime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-944413141314449 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 944413141314394 and 944413141314403.
It is not a weakly prime, because it can be changed into another prime (944413141314443) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 472206570657224 + 472206570657225.
It is an arithmetic number, because the mean of its divisors is an integer number (472206570657225).
Almost surely, 2944413141314449 is an apocalyptic number.
It is an amenable number.
944413141314449 is a deficient number, since it is larger than the sum of its proper divisors (1).
944413141314449 is an equidigital number, since it uses as much as digits as its factorization.
944413141314449 is an evil number, because the sum of its binary digits is even.
The product of its digits is 11943936, while the sum is 56.
The spelling of 944413141314449 in words is "nine hundred forty-four trillion, four hundred thirteen billion, one hundred forty-one million, three hundred fourteen thousand, four hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.100 sec. • engine limits •