Base | Representation |
---|---|
bin | 10101000001001101000… |
… | …011101111010100100101 |
3 | 12010002020211212211122021 |
4 | 111001031003233110211 |
5 | 142131113332243344 |
6 | 3023314332103141 |
7 | 206232424020622 |
oct | 25011503572445 |
9 | 5102224784567 |
10 | 1444401837349 |
11 | 5076271aa939 |
12 | 1b3b27304ab1 |
13 | a628b913803 |
14 | 4dca364d349 |
15 | 2788b2e4b84 |
hex | 1504d0ef525 |
1444401837349 has 2 divisors, whose sum is σ = 1444401837350. Its totient is φ = 1444401837348.
The previous prime is 1444401837331. The next prime is 1444401837353. The reversal of 1444401837349 is 9437381044441.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1034404941249 + 409996896100 = 1017057^2 + 640310^2 .
It is a cyclic number.
It is not a de Polignac number, because 1444401837349 - 239 = 894646023461 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1444401837296 and 1444401837305.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1444401837149) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 722200918674 + 722200918675.
It is an arithmetic number, because the mean of its divisors is an integer number (722200918675).
Almost surely, 21444401837349 is an apocalyptic number.
It is an amenable number.
1444401837349 is a deficient number, since it is larger than the sum of its proper divisors (1).
1444401837349 is an equidigital number, since it uses as much as digits as its factorization.
1444401837349 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4644864, while the sum is 52.
The spelling of 1444401837349 in words is "one trillion, four hundred forty-four billion, four hundred one million, eight hundred thirty-seven thousand, three hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •