Base | Representation |
---|---|
bin | 101001110010000101111… |
… | …0111010001111110000111 |
3 | 202022222120121011121212201 |
4 | 1103210023313101332013 |
5 | 1223041241000100110 |
6 | 20114033403255331 |
7 | 1131613150205125 |
oct | 123441367217607 |
9 | 22288517147781 |
10 | 5742570315655 |
11 | 1914457264408 |
12 | 788b4721a547 |
13 | 3286a2c622a4 |
14 | 15bd28770915 |
15 | 9e59dc7ab3a |
hex | 5390bdd1f87 |
5742570315655 has 4 divisors (see below), whose sum is σ = 6891084378792. Its totient is φ = 4594056252520.
The previous prime is 5742570315623. The next prime is 5742570315659. The reversal of 5742570315655 is 5565130752475.
It is a semiprime because it is the product of two primes.
It is not a de Polignac number, because 5742570315655 - 25 = 5742570315623 is a prime.
It is a super-2 number, since 2×57425703156552 (a number of 26 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 = 5742570315596 and 5742570315605.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5742570315659) 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, 574257031561 + ... + 574257031570.
It is an arithmetic number, because the mean of its divisors is an integer number (1722771094698).
Almost surely, 25742570315655 is an apocalyptic number.
5742570315655 is a deficient number, since it is larger than the sum of its proper divisors (1148514063137).
5742570315655 is a wasteful number, since it uses less digits than its factorization.
5742570315655 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1148514063136.
The product of its (nonzero) digits is 22050000, while the sum is 55.
The spelling of 5742570315655 in words is "five trillion, seven hundred forty-two billion, five hundred seventy million, three hundred fifteen thousand, six hundred fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •