Base | Representation |
---|---|
bin | 1001100110011010011111… |
… | …00111101101011001001101 |
3 | 2202202012102212021020002221 |
4 | 10303031033213231121031 |
5 | 10231341013104210303 |
6 | 112522145552415341 |
7 | 4306140511543642 |
oct | 463151747553115 |
9 | 82665385236087 |
10 | 21111100069453 |
11 | 67aa192695549 |
12 | 244b580847551 |
13 | ba19ca952934 |
14 | 52dad5a03dc9 |
15 | 2692350914bd |
hex | 13334f9ed64d |
21111100069453 has 2 divisors, whose sum is σ = 21111100069454. Its totient is φ = 21111100069452.
The previous prime is 21111100069363. The next prime is 21111100069481. The reversal of 21111100069453 is 35496000111112.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 17772067470249 + 3339032599204 = 4215693^2 + 1827302^2 .
It is a cyclic number.
It is not a de Polignac number, because 21111100069453 - 241 = 18912076813901 is a prime.
It is a super-3 number, since 3×211111000694533 (a number of 41 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (21111100069483) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10555550034726 + 10555550034727.
It is an arithmetic number, because the mean of its divisors is an integer number (10555550034727).
Almost surely, 221111100069453 is an apocalyptic number.
It is an amenable number.
21111100069453 is a deficient number, since it is larger than the sum of its proper divisors (1).
21111100069453 is an equidigital number, since it uses as much as digits as its factorization.
21111100069453 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 6480, while the sum is 34.
The spelling of 21111100069453 in words is "twenty-one trillion, one hundred eleven billion, one hundred million, sixty-nine thousand, four hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •