Base | Representation |
---|---|
bin | 1001100011100000011011… |
… | …11000110010001001100001 |
3 | 2202101122121120010102020201 |
4 | 10301300031320302021201 |
5 | 10223221431012020223 |
6 | 112404230142105201 |
7 | 4266003305510563 |
oct | 461601570621141 |
9 | 82348546112221 |
10 | 21011213001313 |
11 | 6770894a83867 |
12 | 243414487b201 |
13 | b9546c663ba2 |
14 | 528d3b97d333 |
15 | 26683ac12ead |
hex | 131c0de32261 |
21011213001313 has 2 divisors, whose sum is σ = 21011213001314. Its totient is φ = 21011213001312.
The previous prime is 21011213001299. The next prime is 21011213001341. The reversal of 21011213001313 is 31310031211012.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 12563395182144 + 8447817819169 = 3544488^2 + 2906513^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-21011213001313 is a prime.
It is not a weakly prime, because it can be changed into another prime (21011213001343) 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, 10505606500656 + 10505606500657.
It is an arithmetic number, because the mean of its divisors is an integer number (10505606500657).
Almost surely, 221011213001313 is an apocalyptic number.
It is an amenable number.
21011213001313 is a deficient number, since it is larger than the sum of its proper divisors (1).
21011213001313 is an equidigital number, since it uses as much as digits as its factorization.
21011213001313 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 19.
Adding to 21011213001313 its reverse (31310031211012), we get a palindrome (52321244212325).
The spelling of 21011213001313 in words is "twenty-one trillion, eleven billion, two hundred thirteen million, one thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •