Base | Representation |
---|---|
bin | 100110010000111100000… |
… | …1000110101101100101001 |
3 | 200121202112121211202101012 |
4 | 1030201320020311230221 |
5 | 1142131021210201241 |
6 | 15103550552033305 |
7 | 1051645204430033 |
oct | 114417010655451 |
9 | 20552477752335 |
10 | 5259055553321 |
11 | 1748397835a79 |
12 | 70b2a7092835 |
13 | 2c1c0828441b |
14 | 14277ab10c53 |
15 | 91c0053c6eb |
hex | 4c878235b29 |
5259055553321 has 2 divisors, whose sum is σ = 5259055553322. Its totient is φ = 5259055553320.
The previous prime is 5259055553249. The next prime is 5259055553327. The reversal of 5259055553321 is 1233555509525.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 5214536663296 + 44518890025 = 2283536^2 + 210995^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-5259055553321 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 5259055553321.
It is not a weakly prime, because it can be changed into another prime (5259055553327) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2629527776660 + 2629527776661.
It is an arithmetic number, because the mean of its divisors is an integer number (2629527776661).
Almost surely, 25259055553321 is an apocalyptic number.
It is an amenable number.
5259055553321 is a deficient number, since it is larger than the sum of its proper divisors (1).
5259055553321 is an equidigital number, since it uses as much as digits as its factorization.
5259055553321 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5062500, while the sum is 50.
The spelling of 5259055553321 in words is "five trillion, two hundred fifty-nine billion, fifty-five million, five hundred fifty-three thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.101 sec. • engine limits •