Base | Representation |
---|---|
bin | 100000010101100110101… |
… | …100110101001011001001 |
3 | 21212102221102002101211101 |
4 | 200111212230311023021 |
5 | 242402102101321301 |
6 | 4420512502501401 |
7 | 316356465601045 |
oct | 40254654651311 |
9 | 7772842071741 |
10 | 2222221120201 |
11 | 787490986535 |
12 | 2ba821434861 |
13 | 131729475a84 |
14 | 797adc31025 |
15 | 3cc121ac701 |
hex | 20566b352c9 |
2222221120201 has 2 divisors, whose sum is σ = 2222221120202. Its totient is φ = 2222221120200.
The previous prime is 2222221120199. The next prime is 2222221120247. The reversal of 2222221120201 is 1020211222222.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1263153457801 + 959067662400 = 1123901^2 + 979320^2 .
It is a cyclic number.
It is not a de Polignac number, because 2222221120201 - 21 = 2222221120199 is a prime.
Together with 2222221120199, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (2222221100201) 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, 1111110560100 + 1111110560101.
It is an arithmetic number, because the mean of its divisors is an integer number (1111110560101).
Almost surely, 22222221120201 is an apocalyptic number.
It is an amenable number.
2222221120201 is a deficient number, since it is larger than the sum of its proper divisors (1).
2222221120201 is an equidigital number, since it uses as much as digits as its factorization.
2222221120201 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 19.
Adding to 2222221120201 its reverse (1020211222222), we get a palindrome (3242432342423).
The spelling of 2222221120201 in words is "two trillion, two hundred twenty-two billion, two hundred twenty-one million, one hundred twenty thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •