Base | Representation |
---|---|
bin | 101001111111111111101… |
… | …1010001101000010001101 |
3 | 202102211122022011112100002 |
4 | 1103333333122031002031 |
5 | 1224033412042401431 |
6 | 20135452125214045 |
7 | 1134021046413164 |
oct | 123777732150215 |
9 | 22384568145302 |
10 | 5772426137741 |
11 | 192608808243a |
12 | 792899a01325 |
13 | 32b4504b64c3 |
14 | 15d55b9a83db |
15 | a0249dc53cb |
hex | 53fff68d08d |
5772426137741 has 4 divisors (see below), whose sum is σ = 6023401187232. Its totient is φ = 5521451088252.
The previous prime is 5772426137729. The next prime is 5772426137743. The reversal of 5772426137741 is 1477316242775.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-5772426137741 is a prime.
It is a super-4 number, since 4×57724261377414 (a number of 52 digits) contains 4444 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5772426137743) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 125487524711 + ... + 125487524756.
It is an arithmetic number, because the mean of its divisors is an integer number (1505850296808).
Almost surely, 25772426137741 is an apocalyptic number.
It is an amenable number.
5772426137741 is a deficient number, since it is larger than the sum of its proper divisors (250975049491).
5772426137741 is a wasteful number, since it uses less digits than its factorization.
5772426137741 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 250975049490.
The product of its digits is 13829760, while the sum is 56.
The spelling of 5772426137741 in words is "five trillion, seven hundred seventy-two billion, four hundred twenty-six million, one hundred thirty-seven thousand, seven hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •