Base | Representation |
---|---|
bin | 1100111011101001101… |
… | …11000000111100100101 |
3 | 1120110220222021001021112 |
4 | 12131310313000330211 |
5 | 24240003101212331 |
6 | 540043351354405 |
7 | 44050133320121 |
oct | 6356467007445 |
9 | 1513828231245 |
10 | 444342210341 |
11 | 161498659327 |
12 | 72149382a05 |
13 | 32b9419ba23 |
14 | 17713324581 |
15 | b85970132b |
hex | 6774dc0f25 |
444342210341 has 2 divisors, whose sum is σ = 444342210342. Its totient is φ = 444342210340.
The previous prime is 444342210287. The next prime is 444342210349. The reversal of 444342210341 is 143012243444.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 325555830625 + 118786379716 = 570575^2 + 344654^2 .
It is a cyclic number.
It is not a de Polignac number, because 444342210341 - 214 = 444342193957 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 444342210298 and 444342210307.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (444342210349) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 222171105170 + 222171105171.
It is an arithmetic number, because the mean of its divisors is an integer number (222171105171).
Almost surely, 2444342210341 is an apocalyptic number.
It is an amenable number.
444342210341 is a deficient number, since it is larger than the sum of its proper divisors (1).
444342210341 is an equidigital number, since it uses as much as digits as its factorization.
444342210341 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 36864, while the sum is 32.
Adding to 444342210341 its reverse (143012243444), we get a palindrome (587354453785).
The spelling of 444342210341 in words is "four hundred forty-four billion, three hundred forty-two million, two hundred ten thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •