Base | Representation |
---|---|
bin | 1100111011001000000… |
… | …1100111111010000101 |
3 | 210020002122210211100122 |
4 | 3032302001213322011 |
5 | 12114204201232044 |
6 | 245555455351325 |
7 | 22020053505032 |
oct | 3166201477205 |
9 | 706078724318 |
10 | 222030102149 |
11 | 86187227a99 |
12 | 37045522545 |
13 | 17c2548078b |
14 | aa63c5a389 |
15 | 5b9754bdee |
hex | 33b2067e85 |
222030102149 has 2 divisors, whose sum is σ = 222030102150. Its totient is φ = 222030102148.
The previous prime is 222030102101. The next prime is 222030102187. The reversal of 222030102149 is 941201030222.
222030102149 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 195910693924 + 26119408225 = 442618^2 + 161615^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-222030102149 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (222030102949) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 111015051074 + 111015051075.
It is an arithmetic number, because the mean of its divisors is an integer number (111015051075).
Almost surely, 2222030102149 is an apocalyptic number.
It is an amenable number.
222030102149 is a deficient number, since it is larger than the sum of its proper divisors (1).
222030102149 is an equidigital number, since it uses as much as digits as its factorization.
222030102149 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1728, while the sum is 26.
The spelling of 222030102149 in words is "two hundred twenty-two billion, thirty million, one hundred two thousand, one hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •