Base | Representation |
---|---|
bin | 1011110101111011111111… |
… | …0001001001100101100001 |
3 | 1201002211011012222100102112 |
4 | 2331132333301021211201 |
5 | 3201320021340104003 |
6 | 43405515152525105 |
7 | 2512520020024664 |
oct | 275367761114541 |
9 | 51084135870375 |
10 | 13021263206753 |
11 | 417031768673a |
12 | 1563736850795 |
13 | 735b90c87c69 |
14 | 330337db16db |
15 | 178aa62763d8 |
hex | bd7bfc49961 |
13021263206753 has 2 divisors, whose sum is σ = 13021263206754. Its totient is φ = 13021263206752.
The previous prime is 13021263206711. The next prime is 13021263206773. The reversal of 13021263206753 is 35760236212031.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 8147182622929 + 4874080583824 = 2854327^2 + 2207732^2 .
It is a cyclic number.
It is not a de Polignac number, because 13021263206753 - 216 = 13021263141217 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 13021263206753.
It is not a weakly prime, because it can be changed into another prime (13021263206773) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6510631603376 + 6510631603377.
It is an arithmetic number, because the mean of its divisors is an integer number (6510631603377).
Almost surely, 213021263206753 is an apocalyptic number.
It is an amenable number.
13021263206753 is a deficient number, since it is larger than the sum of its proper divisors (1).
13021263206753 is an equidigital number, since it uses as much as digits as its factorization.
13021263206753 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 272160, while the sum is 41.
Adding to 13021263206753 its reverse (35760236212031), we get a palindrome (48781499418784).
The spelling of 13021263206753 in words is "thirteen trillion, twenty-one billion, two hundred sixty-three million, two hundred six thousand, seven hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •