Base | Representation |
---|---|
bin | 1010000110110100000101… |
… | …00000000011110111001011 |
3 | 2220200121221011211222211002 |
4 | 11003122002200003313023 |
5 | 10403110432124411021 |
6 | 115133420415125215 |
7 | 4452441055026014 |
oct | 503320240036713 |
9 | 86617834758732 |
10 | 22224350232011 |
11 | 7099326355804 |
12 | 25ab289b1380b |
13 | c5299389b285 |
14 | 56b942b5600b |
15 | 28818de0b50b |
hex | 143682803dcb |
22224350232011 has 8 divisors (see below), whose sum is σ = 22280582792400. Its totient is φ = 22168118937888.
The previous prime is 22224350232001. The next prime is 22224350232047. The reversal of 22224350232011 is 11023205342222.
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-22224350232011 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (22224350232001) 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 in 7 ways as a sum of consecutive naturals, for example, 41957360 + ... + 42483746.
It is an arithmetic number, because the mean of its divisors is an integer number (2785072849050).
Almost surely, 222224350232011 is an apocalyptic number.
22224350232011 is a deficient number, since it is larger than the sum of its proper divisors (56232560389).
22224350232011 is a wasteful number, since it uses less digits than its factorization.
22224350232011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 633133.
The product of its (nonzero) digits is 11520, while the sum is 29.
Adding to 22224350232011 its reverse (11023205342222), we get a palindrome (33247555574233).
The spelling of 22224350232011 in words is "twenty-two trillion, two hundred twenty-four billion, three hundred fifty million, two hundred thirty-two thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •