Base | Representation |
---|---|
bin | 100000010100000000110… |
… | …1011101000111011011001 |
3 | 120201120001121220120120102 |
4 | 1000220001223220323121 |
5 | 1040230204221313423 |
6 | 13240102313305145 |
7 | 635565503365106 |
oct | 100500153507331 |
9 | 16646047816512 |
10 | 4441024401113 |
11 | 14624785517a3 |
12 | 5b884a1051b5 |
13 | 262a2c7bac21 |
14 | 114d37b6daad |
15 | 7a7c428bc28 |
hex | 40a01ae8ed9 |
4441024401113 has 2 divisors, whose sum is σ = 4441024401114. Its totient is φ = 4441024401112.
The previous prime is 4441024401101. The next prime is 4441024401139. The reversal of 4441024401113 is 3111044201444.
It is a happy number.
4441024401113 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 3820918550089 + 620105851024 = 1954717^2 + 787468^2 .
It is a cyclic number.
It is not a de Polignac number, because 4441024401113 - 214 = 4441024384729 is a prime.
It is not a weakly prime, because it can be changed into another prime (4441024401193) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2220512200556 + 2220512200557.
It is an arithmetic number, because the mean of its divisors is an integer number (2220512200557).
Almost surely, 24441024401113 is an apocalyptic number.
It is an amenable number.
4441024401113 is a deficient number, since it is larger than the sum of its proper divisors (1).
4441024401113 is an equidigital number, since it uses as much as digits as its factorization.
4441024401113 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 6144, while the sum is 29.
Adding to 4441024401113 its reverse (3111044201444), we get a palindrome (7552068602557).
The spelling of 4441024401113 in words is "four trillion, four hundred forty-one billion, twenty-four million, four hundred one thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •