Base | Representation |
---|---|
bin | 10000111000111101010110… |
… | …10100001100010000111001 |
3 | 11212111200120221211200110021 |
4 | 20130132223110030100321 |
5 | 14332011200314434221 |
6 | 210554314410250441 |
7 | 10552244625305164 |
oct | 1034365324142071 |
9 | 155450527750407 |
10 | 37141456405561 |
11 | 1091a66a9575a2 |
12 | 41ba31a726a21 |
13 | 17955692971b1 |
14 | 925928406adb |
15 | 446203ed2041 |
hex | 21c7ab50c439 |
37141456405561 has 2 divisors, whose sum is σ = 37141456405562. Its totient is φ = 37141456405560.
The previous prime is 37141456405553. The next prime is 37141456405567. The reversal of 37141456405561 is 16550465414173.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 36705955399936 + 435501005625 = 6058544^2 + 659925^2 .
It is a cyclic number.
It is not a de Polignac number, because 37141456405561 - 23 = 37141456405553 is a prime.
It is a super-2 number, since 2×371414564055612 (a number of 28 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 37141456405499 and 37141456405508.
It is not a weakly prime, because it can be changed into another prime (37141456405567) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 18570728202780 + 18570728202781.
It is an arithmetic number, because the mean of its divisors is an integer number (18570728202781).
Almost surely, 237141456405561 is an apocalyptic number.
It is an amenable number.
37141456405561 is a deficient number, since it is larger than the sum of its proper divisors (1).
37141456405561 is an equidigital number, since it uses as much as digits as its factorization.
37141456405561 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6048000, while the sum is 52.
The spelling of 37141456405561 in words is "thirty-seven trillion, one hundred forty-one billion, four hundred fifty-six million, four hundred five thousand, five hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •