Base | Representation |
---|---|
bin | 110101001100101101… |
… | …000011000011001101 |
3 | 12110102220002102120010 |
4 | 311030231003003031 |
5 | 1413441042432422 |
6 | 42124034543433 |
7 | 4061344222113 |
oct | 651455030315 |
9 | 173386072503 |
10 | 57121452237 |
11 | 22252630573 |
12 | b0a1a37b79 |
13 | 550428a8a5 |
14 | 2a9c463ab3 |
15 | 1744b9eb0c |
hex | d4cb430cd |
57121452237 has 8 divisors (see below), whose sum is σ = 80170459360. Its totient is φ = 36076706640.
The previous prime is 57121452211. The next prime is 57121452251. The reversal of 57121452237 is 73225412175.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 57121452237 - 216 = 57121386701 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 57121452195 and 57121452204.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (57121452137) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 501065314 + ... + 501065427.
It is an arithmetic number, because the mean of its divisors is an integer number (10021307420).
Almost surely, 257121452237 is an apocalyptic number.
57121452237 is a gapful number since it is divisible by the number (57) formed by its first and last digit.
It is an amenable number.
57121452237 is a deficient number, since it is larger than the sum of its proper divisors (23049007123).
57121452237 is a wasteful number, since it uses less digits than its factorization.
57121452237 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1002130763.
The product of its digits is 117600, while the sum is 39.
The spelling of 57121452237 in words is "fifty-seven billion, one hundred twenty-one million, four hundred fifty-two thousand, two hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •