Base | Representation |
---|---|
bin | 1001100100101110010100… |
… | …00001101000111101110101 |
3 | 2202112122112110011121011222 |
4 | 10302113022001220331311 |
5 | 10224413043140122034 |
6 | 112435343100040125 |
7 | 4302013364411504 |
oct | 462271201507565 |
9 | 82478473147158 |
10 | 21053024145269 |
11 | 67875a0308096 |
12 | 2440273233045 |
13 | b993a3a0895c |
14 | 52ad868c483b |
15 | 26798670512e |
hex | 1325ca068f75 |
21053024145269 has 2 divisors, whose sum is σ = 21053024145270. Its totient is φ = 21053024145268.
The previous prime is 21053024145203. The next prime is 21053024145271. The reversal of 21053024145269 is 96254142035012.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 20788994655025 + 264029490244 = 4559495^2 + 513838^2 .
It is a cyclic number.
It is not a de Polignac number, because 21053024145269 - 236 = 20984304668533 is a prime.
It is a super-2 number, since 2×210530241452692 (a number of 27 digits) contains 22 as substring.
Together with 21053024145271, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (21053024141269) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10526512072634 + 10526512072635.
It is an arithmetic number, because the mean of its divisors is an integer number (10526512072635).
Almost surely, 221053024145269 is an apocalyptic number.
It is an amenable number.
21053024145269 is a deficient number, since it is larger than the sum of its proper divisors (1).
21053024145269 is an equidigital number, since it uses as much as digits as its factorization.
21053024145269 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 518400, while the sum is 44.
The spelling of 21053024145269 in words is "twenty-one trillion, fifty-three billion, twenty-four million, one hundred forty-five thousand, two hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •