Base | Representation |
---|---|
bin | 110000101111100111… |
… | …110100101100111111 |
3 | 12000002120021011001212 |
4 | 300233213310230333 |
5 | 1324142133414231 |
6 | 40013301155035 |
7 | 3531666362066 |
oct | 605747645477 |
9 | 160076234055 |
10 | 52338576191 |
11 | 20218841a50 |
12 | a1880bba7b |
13 | 4c21400615 |
14 | 27671611dd |
15 | 1564d3642b |
hex | c2f9f4b3f |
52338576191 has 4 divisors (see below), whose sum is σ = 57096628584. Its totient is φ = 47580523800.
The previous prime is 52338576179. The next prime is 52338576203. The reversal of 52338576191 is 19167583325.
It is a semiprime because it is the product of two primes.
It is an interprime number because it is at equal distance from previous prime (52338576179) and next prime (52338576203).
It is a cyclic number.
It is not a de Polignac number, because 52338576191 - 210 = 52338575167 is a prime.
It is a super-2 number, since 2×523385761912 (a number of 22 digits) contains 22 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 (52338576491) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2379026180 + ... + 2379026201.
It is an arithmetic number, because the mean of its divisors is an integer number (14274157146).
Almost surely, 252338576191 is an apocalyptic number.
52338576191 is a deficient number, since it is larger than the sum of its proper divisors (4758052393).
52338576191 is a wasteful number, since it uses less digits than its factorization.
52338576191 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4758052392.
The product of its digits is 1360800, while the sum is 50.
The spelling of 52338576191 in words is "fifty-two billion, three hundred thirty-eight million, five hundred seventy-six thousand, one hundred ninety-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •