Base | Representation |
---|---|
bin | 1100000000100001110111… |
… | …0101100101100101101001 |
3 | 1201202012211210200222220201 |
4 | 3000020131311211211221 |
5 | 3212310203343223021 |
6 | 44025251413552201 |
7 | 2531621230512565 |
oct | 300103565454551 |
9 | 51665753628821 |
10 | 13203230054761 |
11 | 423050518193a |
12 | 1592a5b045661 |
13 | 74a0a0239ca6 |
14 | 33907b0b66a5 |
15 | 17d6a6494591 |
hex | c021dd65969 |
13203230054761 has 2 divisors, whose sum is σ = 13203230054762. Its totient is φ = 13203230054760.
The previous prime is 13203230054731. The next prime is 13203230054779. The reversal of 13203230054761 is 16745003230231.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 12535536789136 + 667693265625 = 3540556^2 + 817125^2 .
It is a cyclic number.
It is not a de Polignac number, because 13203230054761 - 213 = 13203230046569 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 13203230054761.
It is not a weakly prime, because it can be changed into another prime (13203230054731) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6601615027380 + 6601615027381.
It is an arithmetic number, because the mean of its divisors is an integer number (6601615027381).
Almost surely, 213203230054761 is an apocalyptic number.
It is an amenable number.
13203230054761 is a deficient number, since it is larger than the sum of its proper divisors (1).
13203230054761 is an equidigital number, since it uses as much as digits as its factorization.
13203230054761 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 90720, while the sum is 37.
Adding to 13203230054761 its reverse (16745003230231), we get a palindrome (29948233284992).
The spelling of 13203230054761 in words is "thirteen trillion, two hundred three billion, two hundred thirty million, fifty-four thousand, seven hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •