Base | Representation |
---|---|
bin | 1011110110100100110110… |
… | …0111101000010000101101 |
3 | 1201010212110201121002210212 |
4 | 2331221031213220100231 |
5 | 3202010003122311341 |
6 | 43414531501512205 |
7 | 2513355611563205 |
oct | 275511547502055 |
9 | 51125421532725 |
10 | 13032233010221 |
11 | 4174a3686a417 |
12 | 1565898572665 |
13 | 736c1b86c029 |
14 | 330a98c61405 |
15 | 178ee934d5eb |
hex | bda4d9e842d |
13032233010221 has 2 divisors, whose sum is σ = 13032233010222. Its totient is φ = 13032233010220.
The previous prime is 13032233010091. The next prime is 13032233010257. The reversal of 13032233010221 is 12201033223031.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 13029313228996 + 2919781225 = 3609614^2 + 54035^2 .
It is a cyclic number.
It is not a de Polignac number, because 13032233010221 - 222 = 13032228815917 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13032233010271) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6516116505110 + 6516116505111.
It is an arithmetic number, because the mean of its divisors is an integer number (6516116505111).
Almost surely, 213032233010221 is an apocalyptic number.
It is an amenable number.
13032233010221 is a deficient number, since it is larger than the sum of its proper divisors (1).
13032233010221 is an equidigital number, since it uses as much as digits as its factorization.
13032233010221 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1296, while the sum is 23.
Adding to 13032233010221 its reverse (12201033223031), we get a palindrome (25233266233252).
The spelling of 13032233010221 in words is "thirteen trillion, thirty-two billion, two hundred thirty-three million, ten thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •