Base | Representation |
---|---|
bin | 1010010010000000010000… |
… | …0100000111010000001110 |
3 | 1111000200200121120011212121 |
4 | 2210200010010013100032 |
5 | 2440202424030011342 |
6 | 40013102501523154 |
7 | 2244501055342423 |
oct | 244400404072016 |
9 | 44020617504777 |
10 | 11304422110222 |
11 | 36691a663705a |
12 | 1326a581134ba |
13 | 640005457717 |
14 | 2b11cbb09d4a |
15 | 1490c21bd067 |
hex | a480410740e |
11304422110222 has 8 divisors (see below), whose sum is σ = 17131443816816. Its totient is φ = 5593940837952.
The previous prime is 11304422110171. The next prime is 11304422110229. The reversal of 11304422110222 is 22201122440311.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-3 number, since 3×113044221102223 (a number of 40 digits) contains 333 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11304422110229) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 29135108338 + ... + 29135108725.
It is an arithmetic number, because the mean of its divisors is an integer number (2141430477102).
Almost surely, 211304422110222 is an apocalyptic number.
11304422110222 is a deficient number, since it is larger than the sum of its proper divisors (5827021706594).
11304422110222 is an equidigital number, since it uses as much as digits as its factorization.
11304422110222 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 58270217162.
The product of its (nonzero) digits is 1536, while the sum is 25.
Adding to 11304422110222 its reverse (22201122440311), we get a palindrome (33505544550533).
The spelling of 11304422110222 in words is "eleven trillion, three hundred four billion, four hundred twenty-two million, one hundred ten thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •