Base | Representation |
---|---|
bin | 110010111001100010100100… |
… | …1110000101110011010101101 |
3 | 2011201012221022102022212020121 |
4 | 1211303011021300232122231 |
5 | 432140312031343142031 |
6 | 4224112251055444541 |
7 | 163206122416205332 |
oct | 14563051160563255 |
9 | 2151187272285217 |
10 | 447712923412141 |
11 | 11a722a91461502 |
12 | 42269920226751 |
13 | 162a81bc1454aa |
14 | 7c7b5c7770989 |
15 | 36b6091e76011 |
hex | 1973149c2e6ad |
447712923412141 has 2 divisors, whose sum is σ = 447712923412142. Its totient is φ = 447712923412140.
The previous prime is 447712923412109. The next prime is 447712923412169. The reversal of 447712923412141 is 141214329217744.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 240561526922116 + 207151396490025 = 15510046^2 + 14392755^2 .
It is a cyclic number.
It is not a de Polignac number, because 447712923412141 - 25 = 447712923412109 is a prime.
It is a super-2 number, since 2×4477129234121412 (a number of 30 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (447712923413141) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 223856461706070 + 223856461706071.
It is an arithmetic number, because the mean of its divisors is an integer number (223856461706071).
Almost surely, 2447712923412141 is an apocalyptic number.
It is an amenable number.
447712923412141 is a deficient number, since it is larger than the sum of its proper divisors (1).
447712923412141 is an equidigital number, since it uses as much as digits as its factorization.
447712923412141 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 2709504, while the sum is 52.
The spelling of 447712923412141 in words is "four hundred forty-seven trillion, seven hundred twelve billion, nine hundred twenty-three million, four hundred twelve thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •