Base | Representation |
---|---|
bin | 10010111101001010111111… |
… | …10110011011001111011101 |
3 | 12110120222101011000010002121 |
4 | 21132211133312123033131 |
5 | 20430423334010214212 |
6 | 224353253131422541 |
7 | 11531405651263231 |
oct | 1136453766331735 |
9 | 173528334003077 |
10 | 41684265710557 |
11 | 1231121a318068 |
12 | 48128342b4a51 |
13 | 1a34a6a2ca5a2 |
14 | a4175a2a05c1 |
15 | 4c448402dd07 |
hex | 25e95fd9b3dd |
41684265710557 has 16 divisors (see below), whose sum is σ = 42832901359360. Its totient is φ = 40536793144512.
The previous prime is 41684265710513. The next prime is 41684265710599. The reversal of 41684265710557 is 75501756248614.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-41684265710557 is a prime.
It is a super-2 number, since 2×416842657105572 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 41684265710495 and 41684265710504.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (41684265716557) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1485050119 + ... + 1485078187.
It is an arithmetic number, because the mean of its divisors is an integer number (2677056334960).
Almost surely, 241684265710557 is an apocalyptic number.
It is an amenable number.
41684265710557 is a deficient number, since it is larger than the sum of its proper divisors (1148635648803).
41684265710557 is a wasteful number, since it uses less digits than its factorization.
41684265710557 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 47332.
The product of its (nonzero) digits is 56448000, while the sum is 61.
The spelling of 41684265710557 in words is "forty-one trillion, six hundred eighty-four billion, two hundred sixty-five million, seven hundred ten thousand, five hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •