Base | Representation |
---|---|
bin | 1001101001011001011011… |
… | …10101101100000101001101 |
3 | 2210010000001010112110212022 |
4 | 10310230231311230011031 |
5 | 10240030434301230403 |
6 | 113041222110215525 |
7 | 4316430044202251 |
oct | 464545565540515 |
9 | 83100033473768 |
10 | 21213612523853 |
11 | 6839708260842 |
12 | 246740bab45a5 |
13 | bab586b32589 |
14 | 534a5c5d8261 |
15 | 26bc34b66d38 |
hex | 134b2dd6c14d |
21213612523853 has 2 divisors, whose sum is σ = 21213612523854. Its totient is φ = 21213612523852.
The previous prime is 21213612523837. The next prime is 21213612523867. The reversal of 21213612523853 is 35832521631212.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 11692549396969 + 9521063126884 = 3419437^2 + 3085622^2 .
It is a cyclic number.
It is not a de Polignac number, because 21213612523853 - 24 = 21213612523837 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (21213612523253) 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, 10606806261926 + 10606806261927.
It is an arithmetic number, because the mean of its divisors is an integer number (10606806261927).
Almost surely, 221213612523853 is an apocalyptic number.
It is an amenable number.
21213612523853 is a deficient number, since it is larger than the sum of its proper divisors (1).
21213612523853 is an equidigital number, since it uses as much as digits as its factorization.
21213612523853 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 518400, while the sum is 44.
The spelling of 21213612523853 in words is "twenty-one trillion, two hundred thirteen billion, six hundred twelve million, five hundred twenty-three thousand, eight hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •