Base | Representation |
---|---|
bin | 1100010011100100000101… |
… | …0001010000011110111001 |
3 | 1202220110220211102022022212 |
4 | 3010321001101100132321 |
5 | 3233134413424303101 |
6 | 44435412443224505 |
7 | 2564346003426233 |
oct | 304710121203671 |
9 | 52813824368285 |
10 | 13530242025401 |
11 | 4347163988512 |
12 | 1626302818135 |
13 | 771b8637ac7a |
14 | 34ac1d895253 |
15 | 186e452a01bb |
hex | c4e414507b9 |
13530242025401 has 2 divisors, whose sum is σ = 13530242025402. Its totient is φ = 13530242025400.
The previous prime is 13530242025323. The next prime is 13530242025463. The reversal of 13530242025401 is 10452024203531.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 12869474634025 + 660767391376 = 3587405^2 + 812876^2 .
It is a cyclic number.
It is not a de Polignac number, because 13530242025401 - 230 = 13529168283577 is a prime.
It is not a weakly prime, because it can be changed into another prime (13530242025481) 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, 6765121012700 + 6765121012701.
It is an arithmetic number, because the mean of its divisors is an integer number (6765121012701).
Almost surely, 213530242025401 is an apocalyptic number.
It is an amenable number.
13530242025401 is a deficient number, since it is larger than the sum of its proper divisors (1).
13530242025401 is an equidigital number, since it uses as much as digits as its factorization.
13530242025401 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 28800, while the sum is 32.
Adding to 13530242025401 its reverse (10452024203531), we get a palindrome (23982266228932).
The spelling of 13530242025401 in words is "thirteen trillion, five hundred thirty billion, two hundred forty-two million, twenty-five thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •