Base | Representation |
---|---|
bin | 1100001100010011011001… |
… | …0100010001000111111101 |
3 | 1202110112221122012220201121 |
4 | 3003010312110101013331 |
5 | 3224113433034313001 |
6 | 44302223103110541 |
7 | 2552341614503161 |
oct | 303046624210775 |
9 | 52415848186647 |
10 | 13405504213501 |
11 | 42a9273714174 |
12 | 16060b02a2451 |
13 | 76319775420a |
14 | 344b8921aca1 |
15 | 183a943d36a1 |
hex | c31365111fd |
13405504213501 has 2 divisors, whose sum is σ = 13405504213502. Its totient is φ = 13405504213500.
The previous prime is 13405504213457. The next prime is 13405504213513. The reversal of 13405504213501 is 10531240550431.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 13315741057476 + 89763156025 = 3649074^2 + 299605^2 .
It is an emirp because it is prime and its reverse (10531240550431) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 13405504213501 - 217 = 13405504082429 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13405504213531) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6702752106750 + 6702752106751.
It is an arithmetic number, because the mean of its divisors is an integer number (6702752106751).
Almost surely, 213405504213501 is an apocalyptic number.
It is an amenable number.
13405504213501 is a deficient number, since it is larger than the sum of its proper divisors (1).
13405504213501 is an equidigital number, since it uses as much as digits as its factorization.
13405504213501 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 36000, while the sum is 34.
Adding to 13405504213501 its reverse (10531240550431), we get a palindrome (23936744763932).
The spelling of 13405504213501 in words is "thirteen trillion, four hundred five billion, five hundred four million, two hundred thirteen thousand, five hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •