Base | Representation |
---|---|
bin | 110101000111101111… |
… | …100100000011011111 |
3 | 12110020002111002010020 |
4 | 311013233210003133 |
5 | 1413303241210011 |
6 | 42111503043223 |
7 | 4056313630002 |
oct | 650757440337 |
9 | 173202432106 |
10 | 57038225631 |
11 | 2220a656152 |
12 | b079ba0513 |
13 | 54bcc6a98a |
14 | 2a9139b539 |
15 | 173c710006 |
hex | d47be40df |
57038225631 has 8 divisors (see below), whose sum is σ = 80524553904. Its totient is φ = 35788690560.
The previous prime is 57038225623. The next prime is 57038225639. The reversal of 57038225631 is 13652283075.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (57038225623) and next prime (57038225639).
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 57038225631 - 23 = 57038225623 is a prime.
It is a super-2 number, since 2×570382256312 (a number of 22 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (57038225639) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 559198240 + ... + 559198341.
It is an arithmetic number, because the mean of its divisors is an integer number (10065569238).
Almost surely, 257038225631 is an apocalyptic number.
57038225631 is a gapful number since it is divisible by the number (51) formed by its first and last digit.
57038225631 is a deficient number, since it is larger than the sum of its proper divisors (23486328273).
57038225631 is a wasteful number, since it uses less digits than its factorization.
57038225631 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1118396601.
The product of its (nonzero) digits is 302400, while the sum is 42.
The spelling of 57038225631 in words is "fifty-seven billion, thirty-eight million, two hundred twenty-five thousand, six hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •