Base | Representation |
---|---|
bin | 1101000011101100101… |
… | …1011000110000011000 |
3 | 210110001000121200001012 |
4 | 3100323023120300120 |
5 | 12133412232440440 |
6 | 251020054513052 |
7 | 22131064141403 |
oct | 3207313306030 |
9 | 713030550035 |
10 | 224331140120 |
11 | 8715809796a |
12 | 37588065788 |
13 | 182010ca1c9 |
14 | ac016b8d3a |
15 | 5c7e575e65 |
hex | 343b2d8c18 |
224331140120 has 16 divisors (see below), whose sum is σ = 504745065360. Its totient is φ = 89732456032.
The previous prime is 224331140093. The next prime is 224331140203. The reversal of 224331140120 is 21041133422.
It is a super-2 number, since 2×2243311401202 (a number of 24 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
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, 2804139212 + ... + 2804139291.
It is an arithmetic number, because the mean of its divisors is an integer number (31546566585).
Almost surely, 2224331140120 is an apocalyptic number.
224331140120 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
224331140120 is an abundant number, since it is smaller than the sum of its proper divisors (280413925240).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
224331140120 is a wasteful number, since it uses less digits than its factorization.
224331140120 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5608278514 (or 5608278510 counting only the distinct ones).
The product of its (nonzero) digits is 1152, while the sum is 23.
Adding to 224331140120 its reverse (21041133422), we get a palindrome (245372273542).
The spelling of 224331140120 in words is "two hundred twenty-four billion, three hundred thirty-one million, one hundred forty thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •