Base | Representation |
---|---|
bin | 10011110110101101000010… |
… | …11010001100001010000001 |
3 | 12201120221210200110011222101 |
4 | 21323112201122030022001 |
5 | 21210320312420424103 |
6 | 232505335411310401 |
7 | 12124256351260054 |
oct | 1173264132141201 |
9 | 181527720404871 |
10 | 43661050561153 |
11 | 12a03602889563 |
12 | 4a919795ab401 |
13 | 1b492b1042b5c |
14 | aad2c5858a9b |
15 | 50aacdd9da1d |
hex | 27b5a168c281 |
43661050561153 has 2 divisors, whose sum is σ = 43661050561154. Its totient is φ = 43661050561152.
The previous prime is 43661050561147. The next prime is 43661050561157. The reversal of 43661050561153 is 35116505016634.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 42209150878449 + 1451899682704 = 6496857^2 + 1204948^2 .
It is a cyclic number.
It is not a de Polignac number, because 43661050561153 - 221 = 43661048464001 is a prime.
It is a super-2 number, since 2×436610505611532 (a number of 28 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (43661050561157) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 21830525280576 + 21830525280577.
It is an arithmetic number, because the mean of its divisors is an integer number (21830525280577).
Almost surely, 243661050561153 is an apocalyptic number.
It is an amenable number.
43661050561153 is a deficient number, since it is larger than the sum of its proper divisors (1).
43661050561153 is an equidigital number, since it uses as much as digits as its factorization.
43661050561153 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 972000, while the sum is 46.
Adding to 43661050561153 its reverse (35116505016634), we get a palindrome (78777555577787).
The spelling of 43661050561153 in words is "forty-three trillion, six hundred sixty-one billion, fifty million, five hundred sixty-one thousand, one hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •