Base | Representation |
---|---|
bin | 11001001001111011… |
… | …01100101101110001 |
3 | 1021212012010220111111 |
4 | 30210331230231301 |
5 | 210124243234401 |
6 | 10112032113321 |
7 | 655445035642 |
oct | 144475545561 |
9 | 37765126444 |
10 | 13505055601 |
11 | 5800285184 |
12 | 274a995841 |
13 | 1372c06c7b |
14 | 9218796c9 |
15 | 540967e51 |
hex | 324f6cb71 |
13505055601 has 2 divisors, whose sum is σ = 13505055602. Its totient is φ = 13505055600.
The previous prime is 13505055539. The next prime is 13505055607. The reversal of 13505055601 is 10655050531.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 9603804001 + 3901251600 = 97999^2 + 62460^2 .
It is a cyclic number.
It is not a de Polignac number, because 13505055601 - 29 = 13505055089 is a prime.
It is a super-2 number, since 2×135050556012 (a number of 21 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (13505055607) 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, 6752527800 + 6752527801.
It is an arithmetic number, because the mean of its divisors is an integer number (6752527801).
Almost surely, 213505055601 is an apocalyptic number.
It is an amenable number.
13505055601 is a deficient number, since it is larger than the sum of its proper divisors (1).
13505055601 is an equidigital number, since it uses as much as digits as its factorization.
13505055601 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 11250, while the sum is 31.
The spelling of 13505055601 in words is "thirteen billion, five hundred five million, fifty-five thousand, six hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •