Base | Representation |
---|---|
bin | 1011110100110000100011… |
… | …0001111000101111111101 |
3 | 1201000212212222012111212022 |
4 | 2331030020301320233331 |
5 | 3201002033401101341 |
6 | 43352325535045525 |
7 | 2511202141455422 |
oct | 275141061705775 |
9 | 51025788174768 |
10 | 13001013300221 |
11 | 41627760881a1 |
12 | 155b8250708a5 |
13 | 733cb48a134b |
14 | 32d376835d49 |
15 | 1782bd5e3e4b |
hex | bd308c78bfd |
13001013300221 has 2 divisors, whose sum is σ = 13001013300222. Its totient is φ = 13001013300220.
The previous prime is 13001013300139. The next prime is 13001013300241. The reversal of 13001013300221 is 12200331010031.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 12595301628196 + 405711672025 = 3548986^2 + 636955^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-13001013300221 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 13001013300221.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13001013300241) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6500506650110 + 6500506650111.
It is an arithmetic number, because the mean of its divisors is an integer number (6500506650111).
Almost surely, 213001013300221 is an apocalyptic number.
It is an amenable number.
13001013300221 is a deficient number, since it is larger than the sum of its proper divisors (1).
13001013300221 is an equidigital number, since it uses as much as digits as its factorization.
13001013300221 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 108, while the sum is 17.
Adding to 13001013300221 its reverse (12200331010031), we get a palindrome (25201344310252).
The spelling of 13001013300221 in words is "thirteen trillion, one billion, thirteen million, three hundred thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •