Base | Representation |
---|---|
bin | 10111110001000111110011… |
… | …10101001000010110101011 |
3 | 20212001112000100110012201020 |
4 | 23320203321311020112223 |
5 | 23322303420444343423 |
6 | 303054212201023523 |
7 | 14003022116521515 |
oct | 1370437165102653 |
9 | 225045010405636 |
10 | 52265353512363 |
11 | 15720680559212 |
12 | 5a41461184ba3 |
13 | 23217a8ba8094 |
14 | cc9929a32bb5 |
15 | 60981d7ea4e3 |
hex | 2f88f9d485ab |
52265353512363 has 8 divisors (see below), whose sum is σ = 69729708052368. Its totient is φ = 34822283990304.
The previous prime is 52265353512349. The next prime is 52265353512377. The reversal of 52265353512363 is 36321535356225.
It is an interprime number because it is at equal distance from previous prime (52265353512349) and next prime (52265353512377).
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 52265353512363 - 29 = 52265353511851 is a prime.
It is not an unprimeable number, because it can be changed into a prime (52265353513363) 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, 5321248756 + ... + 5321258577.
It is an arithmetic number, because the mean of its divisors is an integer number (8716213506546).
Almost surely, 252265353512363 is an apocalyptic number.
52265353512363 is a deficient number, since it is larger than the sum of its proper divisors (17464354540005).
52265353512363 is a wasteful number, since it uses less digits than its factorization.
52265353512363 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10642508973.
The product of its digits is 14580000, while the sum is 51.
Adding to 52265353512363 its reverse (36321535356225), we get a palindrome (88586888868588).
The spelling of 52265353512363 in words is "fifty-two trillion, two hundred sixty-five billion, three hundred fifty-three million, five hundred twelve thousand, three hundred sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •