Base | Representation |
---|---|
bin | 11000110011110111… |
… | …10011110100101011 |
3 | 1021101021221200002122 |
4 | 30121323303310223 |
5 | 204234410323201 |
6 | 10041422021455 |
7 | 651040140314 |
oct | 143173636453 |
9 | 37337850078 |
10 | 13320011051 |
11 | 57158874a6 |
12 | 26b8a1788b |
13 | 1343787c59 |
14 | 90506b60b |
15 | 52e5b4e1b |
hex | 319ef3d2b |
13320011051 has 2 divisors, whose sum is σ = 13320011052. Its totient is φ = 13320011050.
The previous prime is 13320011027. The next prime is 13320011059. The reversal of 13320011051 is 15011002331.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-13320011051 is a prime.
It is a Sophie Germain prime.
It is not a weakly prime, because it can be changed into another prime (13320011059) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6660005525 + 6660005526.
It is an arithmetic number, because the mean of its divisors is an integer number (6660005526).
Almost surely, 213320011051 is an apocalyptic number.
13320011051 is a deficient number, since it is larger than the sum of its proper divisors (1).
13320011051 is an equidigital number, since it uses as much as digits as its factorization.
13320011051 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 90, while the sum is 17.
Adding to 13320011051 its reverse (15011002331), we get a palindrome (28331013382).
The spelling of 13320011051 in words is "thirteen billion, three hundred twenty million, eleven thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •