Base | Representation |
---|---|
bin | 10111101110100110001001… |
… | …00011000011000110011011 |
3 | 20211202012222120120211112121 |
4 | 23313103010203003012123 |
5 | 23314343142404441013 |
6 | 302550255531522111 |
7 | 13663530236031346 |
oct | 1367230443030633 |
9 | 224665876524477 |
10 | 52178560233883 |
11 | 15697891a614a6 |
12 | 5a2867a2b9337 |
13 | 2316556538b75 |
14 | cc565498d45d |
15 | 60743dc4858d |
hex | 2f74c48c319b |
52178560233883 has 2 divisors, whose sum is σ = 52178560233884. Its totient is φ = 52178560233882.
The previous prime is 52178560233823. The next prime is 52178560233931. The reversal of 52178560233883 is 38833206587125.
52178560233883 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 52178560233883 - 217 = 52178560102811 is a prime.
It is a super-2 number, since 2×521785602338832 (a number of 28 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (52178560233803) 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 as a sum of consecutive naturals, namely, 26089280116941 + 26089280116942.
It is an arithmetic number, because the mean of its divisors is an integer number (26089280116942).
Almost surely, 252178560233883 is an apocalyptic number.
52178560233883 is a deficient number, since it is larger than the sum of its proper divisors (1).
52178560233883 is an equidigital number, since it uses as much as digits as its factorization.
52178560233883 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 58060800, while the sum is 61.
The spelling of 52178560233883 in words is "fifty-two trillion, one hundred seventy-eight billion, five hundred sixty million, two hundred thirty-three thousand, eight hundred eighty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •