Base | Representation |
---|---|
bin | 10111110000110100101000… |
… | …11011011101110101111111 |
3 | 20212000112110010211001121020 |
4 | 23320122110123131311333 |
5 | 23322121331430214411 |
6 | 303045351053435223 |
7 | 14002206105222345 |
oct | 1370322433356577 |
9 | 225015403731536 |
10 | 52255062351231 |
11 | 1571727a457573 |
12 | 5a3b46a79bb13 |
13 | 2320828a9601c |
14 | cc9230d5b995 |
15 | 60941a0c7606 |
hex | 2f86946ddd7f |
52255062351231 has 4 divisors (see below), whose sum is σ = 69673416468312. Its totient is φ = 34836708234152.
The previous prime is 52255062351169. The next prime is 52255062351257. The reversal of 52255062351231 is 13215326055225.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 52255062351231 - 213 = 52255062343039 is a prime.
It is a super-2 number, since 2×522550623512312 (a number of 28 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (52255062351031) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 8709177058536 + ... + 8709177058541.
It is an arithmetic number, because the mean of its divisors is an integer number (17418354117078).
Almost surely, 252255062351231 is an apocalyptic number.
52255062351231 is a deficient number, since it is larger than the sum of its proper divisors (17418354117081).
52255062351231 is a wasteful number, since it uses less digits than its factorization.
52255062351231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17418354117080.
The product of its (nonzero) digits is 540000, while the sum is 42.
The spelling of 52255062351231 in words is "fifty-two trillion, two hundred fifty-five billion, sixty-two million, three hundred fifty-one thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •