Base | Representation |
---|---|
bin | 11000110010001000… |
… | …11111110010010101 |
3 | 1021100021122222211222 |
4 | 30121010133302111 |
5 | 204222202323221 |
6 | 10040143140125 |
7 | 650502656303 |
oct | 143104376225 |
9 | 37307588758 |
10 | 13305511061 |
11 | 5708683437 |
12 | 26b3ba4645 |
13 | 134077c08b |
14 | 903175273 |
15 | 52d19d9ab |
hex | 31911fc95 |
13305511061 has 2 divisors, whose sum is σ = 13305511062. Its totient is φ = 13305511060.
The previous prime is 13305510997. The next prime is 13305511067. The reversal of 13305511061 is 16011550331.
13305511061 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 9574622500 + 3730888561 = 97850^2 + 61081^2 .
It is a cyclic number.
It is not a de Polignac number, because 13305511061 - 26 = 13305510997 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 13305511061.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13305511067) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6652755530 + 6652755531.
It is an arithmetic number, because the mean of its divisors is an integer number (6652755531).
Almost surely, 213305511061 is an apocalyptic number.
It is an amenable number.
13305511061 is a deficient number, since it is larger than the sum of its proper divisors (1).
13305511061 is an equidigital number, since it uses as much as digits as its factorization.
13305511061 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1350, while the sum is 26.
The spelling of 13305511061 in words is "thirteen billion, three hundred five million, five hundred eleven thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •