Base | Representation |
---|---|
bin | 1001101101011100001011… |
… | …01011011111111111110001 |
3 | 2210121021121012020122121021 |
4 | 10312232011223133333301 |
5 | 10244314432422421033 |
6 | 113225114211055441 |
7 | 4332445323366241 |
oct | 466560553377761 |
9 | 83537535218537 |
10 | 21352525201393 |
11 | 68926118a9481 |
12 | 248a3195a1581 |
13 | bbb6c43620a9 |
14 | 53b679667b21 |
15 | 2706651a8b2d |
hex | 136b85adfff1 |
21352525201393 has 2 divisors, whose sum is σ = 21352525201394. Its totient is φ = 21352525201392.
The previous prime is 21352525201363. The next prime is 21352525201409. The reversal of 21352525201393 is 39310252525312.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 21077721738304 + 274803463089 = 4591048^2 + 524217^2 .
It is a cyclic number.
It is not a de Polignac number, because 21352525201393 - 237 = 21215086247921 is a prime.
It is a super-2 number, since 2×213525252013932 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (21352525201303) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10676262600696 + 10676262600697.
It is an arithmetic number, because the mean of its divisors is an integer number (10676262600697).
Almost surely, 221352525201393 is an apocalyptic number.
It is an amenable number.
21352525201393 is a deficient number, since it is larger than the sum of its proper divisors (1).
21352525201393 is an equidigital number, since it uses as much as digits as its factorization.
21352525201393 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 486000, while the sum is 43.
The spelling of 21352525201393 in words is "twenty-one trillion, three hundred fifty-two billion, five hundred twenty-five million, two hundred one thousand, three hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •