Base | Representation |
---|---|
bin | 110010100000001101101001… |
… | …1010101010011000100101001 |
3 | 2011020220011110210021110111121 |
4 | 1211000123103111103010221 |
5 | 431211244130312013001 |
6 | 4212445211445055241 |
7 | 162366463255665601 |
oct | 14500332325230451 |
9 | 2136804423243447 |
10 | 444232013001001 |
11 | 119600814263a55 |
12 | 419a71823b7521 |
13 | 160b4b8c372044 |
14 | 7b9ad30a6dc01 |
15 | 36557629836a1 |
hex | 19406d3553129 |
444232013001001 has 2 divisors, whose sum is σ = 444232013001002. Its totient is φ = 444232013001000.
The previous prime is 444232013000999. The next prime is 444232013001041. The reversal of 444232013001001 is 100100310232444.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 431759983957225 + 12472029043776 = 20778835^2 + 3531576^2 .
It is a cyclic number.
It is not a de Polignac number, because 444232013001001 - 21 = 444232013000999 is a prime.
Together with 444232013000999, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (444232013001041) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 222116006500500 + 222116006500501.
It is an arithmetic number, because the mean of its divisors is an integer number (222116006500501).
Almost surely, 2444232013001001 is an apocalyptic number.
It is an amenable number.
444232013001001 is a deficient number, since it is larger than the sum of its proper divisors (1).
444232013001001 is an equidigital number, since it uses as much as digits as its factorization.
444232013001001 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2304, while the sum is 25.
Adding to 444232013001001 its reverse (100100310232444), we get a palindrome (544332323233445).
The spelling of 444232013001001 in words is "four hundred forty-four trillion, two hundred thirty-two billion, thirteen million, one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •