Base | Representation |
---|---|
bin | 110010011111111111110001… |
… | …001011001111101000110111 |
3 | 1002010101122202112121122010222 |
4 | 302133333301023033220313 |
5 | 213102401023111201101 |
6 | 2104211500430404555 |
7 | 64532163210454166 |
oct | 6237776113175067 |
9 | 1063348675548128 |
10 | 222101100100151 |
11 | 6484a60292a848 |
12 | 20ab082106075b |
13 | 96c1075500b3c |
14 | 3cbba719193dd |
15 | 1aa255c9e301b |
hex | c9fff12cfa37 |
222101100100151 has 2 divisors, whose sum is σ = 222101100100152. Its totient is φ = 222101100100150.
The previous prime is 222101100100093. The next prime is 222101100100153. The reversal of 222101100100151 is 151001001101222.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 222101100100151 - 238 = 221826222193207 is a prime.
Together with 222101100100153, 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 (222101100100153) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 111050550050075 + 111050550050076.
It is an arithmetic number, because the mean of its divisors is an integer number (111050550050076).
Almost surely, 2222101100100151 is an apocalyptic number.
222101100100151 is a deficient number, since it is larger than the sum of its proper divisors (1).
222101100100151 is an equidigital number, since it uses as much as digits as its factorization.
222101100100151 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 40, while the sum is 17.
Adding to 222101100100151 its reverse (151001001101222), we get a palindrome (373102101201373).
The spelling of 222101100100151 in words is "two hundred twenty-two trillion, one hundred one billion, one hundred million, one hundred thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •