Base | Representation |
---|---|
bin | 1010000110110000000110… |
… | …00011011001100001000101 |
3 | 2220200102102011102011112002 |
4 | 11003120003003121201011 |
5 | 10403042042233341401 |
6 | 115132424313435045 |
7 | 4452334062326513 |
oct | 503300303314105 |
9 | 86612364364462 |
10 | 22222212012101 |
11 | 7098429392512 |
12 | 25aa991a0ba85 |
13 | c527128babaa |
14 | 56b7bcb9b4b3 |
15 | 2880b6344a6b |
hex | 1436030d9845 |
22222212012101 has 2 divisors, whose sum is σ = 22222212012102. Its totient is φ = 22222212012100.
The previous prime is 22222212012097. The next prime is 22222212012131. The reversal of 22222212012101 is 10121021222222.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 19415920322500 + 2806291689601 = 4406350^2 + 1675199^2 .
It is a cyclic number.
It is not a de Polignac number, because 22222212012101 - 22 = 22222212012097 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (22222212012131) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 11111106006050 + 11111106006051.
It is an arithmetic number, because the mean of its divisors is an integer number (11111106006051).
Almost surely, 222222212012101 is an apocalyptic number.
It is an amenable number.
22222212012101 is a deficient number, since it is larger than the sum of its proper divisors (1).
22222212012101 is an equidigital number, since it uses as much as digits as its factorization.
22222212012101 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 256, while the sum is 20.
Adding to 22222212012101 its reverse (10121021222222), we get a palindrome (32343233234323).
The spelling of 22222212012101 in words is "twenty-two trillion, two hundred twenty-two billion, two hundred twelve million, twelve thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •