Base | Representation |
---|---|
bin | 10100001101011010110110… |
… | …00010101110010110111111 |
3 | 12211100120102022110200001112 |
4 | 22012231123002232112333 |
5 | 21311112300314140133 |
6 | 234304100150032235 |
7 | 12234540065423114 |
oct | 1206553302562677 |
9 | 184316368420045 |
10 | 44441554052543 |
11 | 1318461474581a |
12 | 4b990a264867b |
13 | 1ba4a88a1cbab |
14 | ad8da871c90b |
15 | 52106072c648 |
hex | 286b5b0ae5bf |
44441554052543 has 2 divisors, whose sum is σ = 44441554052544. Its totient is φ = 44441554052542.
The previous prime is 44441554052479. The next prime is 44441554052551. The reversal of 44441554052543 is 34525045514444.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 44441554052543 - 26 = 44441554052479 is a prime.
It is a super-2 number, since 2×444415540525432 (a number of 28 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 44441554052491 and 44441554052500.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (44441554852543) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 22220777026271 + 22220777026272.
It is an arithmetic number, because the mean of its divisors is an integer number (22220777026272).
Almost surely, 244441554052543 is an apocalyptic number.
44441554052543 is a deficient number, since it is larger than the sum of its proper divisors (1).
44441554052543 is an equidigital number, since it uses as much as digits as its factorization.
44441554052543 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 15360000, while the sum is 50.
Adding to 44441554052543 its reverse (34525045514444), we get a palindrome (78966599566987).
The spelling of 44441554052543 in words is "forty-four trillion, four hundred forty-one billion, five hundred fifty-four million, fifty-two thousand, five hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •