Base | Representation |
---|---|
bin | 1100111011000001111… |
… | …0111011011111100001 |
3 | 210020000212010101121002 |
4 | 3032300132323133201 |
5 | 12114131040330423 |
6 | 245553133041345 |
7 | 22016320551251 |
oct | 3166036733741 |
9 | 706025111532 |
10 | 222004230113 |
11 | 86173666a46 |
12 | 37038926255 |
13 | 17c1ccc2693 |
14 | aa60643961 |
15 | 5b9513b228 |
hex | 33b07bb7e1 |
222004230113 has 8 divisors (see below), whose sum is σ = 231865502400. Its totient is φ = 212160367408.
The previous prime is 222004230083. The next prime is 222004230169. The reversal of 222004230113 is 311032400222.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-222004230113 is a prime.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (222004232113) 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, 4326323 + ... + 4377336.
It is an arithmetic number, because the mean of its divisors is an integer number (28983187800).
Almost surely, 2222004230113 is an apocalyptic number.
222004230113 is a gapful number since it is divisible by the number (23) formed by its first and last digit.
It is an amenable number.
222004230113 is a deficient number, since it is larger than the sum of its proper divisors (9861272287).
222004230113 is a wasteful number, since it uses less digits than its factorization.
222004230113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8704791.
The product of its (nonzero) digits is 576, while the sum is 20.
Adding to 222004230113 its reverse (311032400222), we get a palindrome (533036630335).
The spelling of 222004230113 in words is "two hundred twenty-two billion, four million, two hundred thirty thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •