Base | Representation |
---|---|
bin | 11001011010110011… |
… | …01110110100110001 |
3 | 1022020001112020002111 |
4 | 30231121232310301 |
5 | 210422013401001 |
6 | 10134050245321 |
7 | 662114241655 |
oct | 145531566461 |
9 | 38201466074 |
10 | 13646622001 |
11 | 5873187101 |
12 | 278a286841 |
13 | 139634227c |
14 | 9365aaa65 |
15 | 54d0cd851 |
hex | 32d66ed31 |
13646622001 has 2 divisors, whose sum is σ = 13646622002. Its totient is φ = 13646622000.
The previous prime is 13646621909. The next prime is 13646622023. The reversal of 13646622001 is 10022664631.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 11053368225 + 2593253776 = 105135^2 + 50924^2 .
It is a cyclic number.
It is not a de Polignac number, because 13646622001 - 211 = 13646619953 is a prime.
It is not a weakly prime, because it can be changed into another prime (13646622401) 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, 6823311000 + 6823311001.
It is an arithmetic number, because the mean of its divisors is an integer number (6823311001).
Almost surely, 213646622001 is an apocalyptic number.
It is an amenable number.
13646622001 is a deficient number, since it is larger than the sum of its proper divisors (1).
13646622001 is an equidigital number, since it uses as much as digits as its factorization.
13646622001 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 10368, while the sum is 31.
The spelling of 13646622001 in words is "thirteen billion, six hundred forty-six million, six hundred twenty-two thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •