Base | Representation |
---|---|
bin | 1001101001010110110100… |
… | …01111111010001001110001 |
3 | 2210002212102101122112012211 |
4 | 10310223122033322021301 |
5 | 10240020101242023324 |
6 | 113040431011452121 |
7 | 4316350224660304 |
oct | 464533217721161 |
9 | 83085371575184 |
10 | 21212210111089 |
11 | 6839058674328 |
12 | 246709a2b7041 |
13 | bab3c241a83a |
14 | 534968258b3b |
15 | 26bba1997294 |
hex | 134ada3fa271 |
21212210111089 has 2 divisors, whose sum is σ = 21212210111090. Its totient is φ = 21212210111088.
The previous prime is 21212210111087. The next prime is 21212210111119. The reversal of 21212210111089 is 98011101221212.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 11928561750625 + 9283648360464 = 3453775^2 + 3046908^2 .
It is a cyclic number.
It is not a de Polignac number, because 21212210111089 - 21 = 21212210111087 is a prime.
Together with 21212210111087, it forms a pair of twin primes.
It is a self number, because there is not a number n which added to its sum of digits gives 21212210111089.
It is not a weakly prime, because it can be changed into another prime (21212210111087) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10606105055544 + 10606105055545.
It is an arithmetic number, because the mean of its divisors is an integer number (10606105055545).
Almost surely, 221212210111089 is an apocalyptic number.
It is an amenable number.
21212210111089 is a deficient number, since it is larger than the sum of its proper divisors (1).
21212210111089 is an equidigital number, since it uses as much as digits as its factorization.
21212210111089 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1152, while the sum is 31.
The spelling of 21212210111089 in words is "twenty-one trillion, two hundred twelve billion, two hundred ten million, one hundred eleven thousand, eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •