Base | Representation |
---|---|
bin | 1101000011100110010… |
… | …0101010010010110010 |
3 | 210102222010221112101220 |
4 | 3100321210222102302 |
5 | 12133333334223442 |
6 | 251013253405510 |
7 | 22130316223245 |
oct | 3207144522262 |
9 | 712863845356 |
10 | 224304211122 |
11 | 871439747a2 |
12 | 3757b039896 |
13 | 181c865bca4 |
14 | abdbca925c |
15 | 5c7c006eec |
hex | 343992a4b2 |
224304211122 has 8 divisors (see below), whose sum is σ = 448608422256. Its totient is φ = 74768070372.
The previous prime is 224304211049. The next prime is 224304211123. The reversal of 224304211122 is 221112403422.
It is a sphenic number, since it is the product of 3 distinct primes.
224304211122 is an admirable number.
It is a junction number, because it is equal to n+sod(n) for n = 224304211092 and 224304211101.
It is not an unprimeable number, because it can be changed into a prime (224304211123) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 18692017588 + ... + 18692017599.
It is an arithmetic number, because the mean of its divisors is an integer number (56076052782).
Almost surely, 2224304211122 is an apocalyptic number.
224304211122 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
224304211122 is a wasteful number, since it uses less digits than its factorization.
224304211122 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 37384035192.
The product of its (nonzero) digits is 1536, while the sum is 24.
Adding to 224304211122 its reverse (221112403422), we get a palindrome (445416614544).
The spelling of 224304211122 in words is "two hundred twenty-four billion, three hundred four million, two hundred eleven thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •