Base | Representation |
---|---|
bin | 100000010101011010001… |
… | …111000110111110111011 |
3 | 21212102101211121002220112 |
4 | 200111122033012332323 |
5 | 242401140033032420 |
6 | 4420440032414535 |
7 | 316351346246504 |
oct | 40253217067673 |
9 | 7772354532815 |
10 | 2222012002235 |
11 | 787393936073 |
12 | 2ba7833a744b |
13 | 1316c504852c |
14 | 79790157bab |
15 | 3cbedb518c5 |
hex | 2055a3c6fbb |
2222012002235 has 8 divisors (see below), whose sum is σ = 2666750397696. Its totient is φ = 1777385605120.
The previous prime is 2222012002229. The next prime is 2222012002237. The reversal of 2222012002235 is 5322002102222.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 2222012002235 - 24 = 2222012002219 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 2222012002235.
It is not an unprimeable number, because it can be changed into a prime (2222012002237) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 27955931 + ... + 28035300.
It is an arithmetic number, because the mean of its divisors is an integer number (333343799712).
Almost surely, 22222012002235 is an apocalyptic number.
2222012002235 is a deficient number, since it is larger than the sum of its proper divisors (444738395461).
2222012002235 is an equidigital number, since it uses as much as digits as its factorization.
2222012002235 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 55999173.
The product of its (nonzero) digits is 1920, while the sum is 23.
Adding to 2222012002235 its reverse (5322002102222), we get a palindrome (7544014104457).
The spelling of 2222012002235 in words is "two trillion, two hundred twenty-two billion, twelve million, two thousand, two hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •