Base | Representation |
---|---|
bin | 111101001011011001000111… |
… | …0011110000000101011100101 |
3 | 2121120100110222000201210110210 |
4 | 1322112302032132000223211 |
5 | 1031013134440231312323 |
6 | 5144300155121410033 |
7 | 221230265302446243 |
oct | 17226621636005345 |
9 | 2546313860653423 |
10 | 538127432682213 |
11 | 146511620883350 |
12 | 50430850499919 |
13 | 1a13627872c75a |
14 | 96c57145b9793 |
15 | 4232de1dc9293 |
hex | 1e96c8e780ae5 |
538127432682213 has 8 divisors (see below), whose sum is σ = 782730811174176. Its totient is φ = 326137837989200.
The previous prime is 538127432682181. The next prime is 538127432682277. The reversal of 538127432682213 is 312286234721835.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 538127432682213 - 25 = 538127432682181 is a prime.
It is a super-2 number, since 2×5381274326822132 (a number of 30 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (538127432682913) 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, 8153445949698 + ... + 8153445949763.
It is an arithmetic number, because the mean of its divisors is an integer number (97841351396772).
Almost surely, 2538127432682213 is an apocalyptic number.
It is an amenable number.
538127432682213 is a deficient number, since it is larger than the sum of its proper divisors (244603378491963).
538127432682213 is a wasteful number, since it uses less digits than its factorization.
538127432682213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16306891899475.
The product of its digits is 23224320, while the sum is 57.
The spelling of 538127432682213 in words is "five hundred thirty-eight trillion, one hundred twenty-seven billion, four hundred thirty-two million, six hundred eighty-two thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •