Base | Representation |
---|---|
bin | 1001100110011100010110… |
… | …10010011010100000000001 |
3 | 2202202022000121220212022011 |
4 | 10303032023102122200001 |
5 | 10231400040341320001 |
6 | 112522433152412521 |
7 | 4306204355411443 |
oct | 463161322324001 |
9 | 82668017825264 |
10 | 21112101120001 |
11 | 67aa656766651 |
12 | 244b7bbb47141 |
13 | ba1b2a16a038 |
14 | 52db8c946493 |
15 | 269292dcdd51 |
hex | 13338b49a801 |
21112101120001 has 2 divisors, whose sum is σ = 21112101120002. Its totient is φ = 21112101120000.
The previous prime is 21112101119987. The next prime is 21112101120029. The reversal of 21112101120001 is 10002110121112.
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., 19535692806400 + 1576408313601 = 4419920^2 + 1255551^2 .
It is a cyclic number.
It is not a de Polignac number, because 21112101120001 - 237 = 20974662166529 is a prime.
It is a super-2 number, since 2×211121011200012 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (21112101120041) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10556050560000 + 10556050560001.
It is an arithmetic number, because the mean of its divisors is an integer number (10556050560001).
Almost surely, 221112101120001 is an apocalyptic number.
It is an amenable number.
21112101120001 is a deficient number, since it is larger than the sum of its proper divisors (1).
21112101120001 is an equidigital number, since it uses as much as digits as its factorization.
21112101120001 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 21112101120001 its reverse (10002110121112), we get a palindrome (31114211241113).
The spelling of 21112101120001 in words is "twenty-one trillion, one hundred twelve billion, one hundred one million, one hundred twenty thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •