Base | Representation |
---|---|
bin | 10011010011010010001000… |
… | …10010001010101010000001 |
3 | 12120021121102012111102201111 |
4 | 21221221010102022222001 |
5 | 21030400314140311001 |
6 | 230134302104403321 |
7 | 11640323123666065 |
oct | 1151510422125201 |
9 | 176247365442644 |
10 | 42444012432001 |
11 | 1258444a5608a4 |
12 | 4915b25a76541 |
13 | 1a8b5b78a492b |
14 | a6a430567aa5 |
15 | 4d90ed4a8851 |
hex | 269a4448aa81 |
42444012432001 has 2 divisors, whose sum is σ = 42444012432002. Its totient is φ = 42444012432000.
The previous prime is 42444012431993. The next prime is 42444012432013. The reversal of 42444012432001 is 10023421044424.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 38467781017600 + 3976231414401 = 6202240^2 + 1994049^2 .
It is a cyclic number.
It is not a de Polignac number, because 42444012432001 - 23 = 42444012431993 is a prime.
It is not a weakly prime, because it can be changed into another prime (42444012432901) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 21222006216000 + 21222006216001.
It is an arithmetic number, because the mean of its divisors is an integer number (21222006216001).
Almost surely, 242444012432001 is an apocalyptic number.
It is an amenable number.
42444012432001 is a deficient number, since it is larger than the sum of its proper divisors (1).
42444012432001 is an equidigital number, since it uses as much as digits as its factorization.
42444012432001 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 24576, while the sum is 31.
Adding to 42444012432001 its reverse (10023421044424), we get a palindrome (52467433476425).
The spelling of 42444012432001 in words is "forty-two trillion, four hundred forty-four billion, twelve million, four hundred thirty-two thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •