Base | Representation |
---|---|
bin | 110010100000110111101010… |
… | …0001011000010111111000101 |
3 | 2011021012210022120022010221021 |
4 | 1211001233110023002333011 |
5 | 431214233402134412401 |
6 | 4212554451032151141 |
7 | 162406135565525425 |
oct | 14501572413027705 |
9 | 2137183276263837 |
10 | 444322221404101 |
11 | 119635aa5587407 |
12 | 41a00758b384b1 |
13 | 160c0537401361 |
14 | 7ba144b4da485 |
15 | 3657c922792a1 |
hex | 1941bd42c2fc5 |
444322221404101 has 2 divisors, whose sum is σ = 444322221404102. Its totient is φ = 444322221404100.
The previous prime is 444322221403993. The next prime is 444322221404111. The reversal of 444322221404101 is 101404122223444.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 431490566067201 + 12831655336900 = 20772351^2 + 3582130^2 .
It is a cyclic number.
It is not a de Polignac number, because 444322221404101 - 221 = 444322219306949 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (444322221404111) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 222161110702050 + 222161110702051.
It is an arithmetic number, because the mean of its divisors is an integer number (222161110702051).
Almost surely, 2444322221404101 is an apocalyptic number.
It is an amenable number.
444322221404101 is a deficient number, since it is larger than the sum of its proper divisors (1).
444322221404101 is an equidigital number, since it uses as much as digits as its factorization.
444322221404101 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 49152, while the sum is 34.
Adding to 444322221404101 its reverse (101404122223444), we get a palindrome (545726343627545).
The spelling of 444322221404101 in words is "four hundred forty-four trillion, three hundred twenty-two billion, two hundred twenty-one million, four hundred four thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •