Base | Representation |
---|---|
bin | 11001001101010000100001… |
… | …11011101100110000010001 |
3 | 21021021011102220012121012111 |
4 | 30212220100323230300101 |
5 | 24231140424243214231 |
6 | 313520413245025321 |
7 | 14450524060655341 |
oct | 1446502073546021 |
9 | 237234386177174 |
10 | 55431132007441 |
11 | 16731235a27a13 |
12 | 6272b11b55241 |
13 | 24c1196b96c48 |
14 | d98c49a6cd21 |
15 | 661d56e5d4b1 |
hex | 326a10eecc11 |
55431132007441 has 2 divisors, whose sum is σ = 55431132007442. Its totient is φ = 55431132007440.
The previous prime is 55431132007387. The next prime is 55431132007463. The reversal of 55431132007441 is 14470023113455.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 54741353587600 + 689778419841 = 7398740^2 + 830529^2 .
It is a cyclic number.
It is not a de Polignac number, because 55431132007441 - 27 = 55431132007313 is a prime.
It is a super-2 number, since 2×554311320074412 (a number of 28 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 55431132007394 and 55431132007403.
It is not a weakly prime, because it can be changed into another prime (55431132607441) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 27715566003720 + 27715566003721.
It is an arithmetic number, because the mean of its divisors is an integer number (27715566003721).
Almost surely, 255431132007441 is an apocalyptic number.
It is an amenable number.
55431132007441 is a deficient number, since it is larger than the sum of its proper divisors (1).
55431132007441 is an equidigital number, since it uses as much as digits as its factorization.
55431132007441 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 201600, while the sum is 40.
The spelling of 55431132007441 in words is "fifty-five trillion, four hundred thirty-one billion, one hundred thirty-two million, seven thousand, four hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •