Base | Representation |
---|---|
bin | 1101000011101010110… |
… | …1101100010111010000 |
3 | 210110000110222012101121 |
4 | 3100322231230113100 |
5 | 12133403234343422 |
6 | 251015220012024 |
7 | 22130641031452 |
oct | 3207255542720 |
9 | 713013865347 |
10 | 224323356112 |
11 | 871537606a9 |
12 | 37585531014 |
13 | 181cc60319b |
14 | ac006502d2 |
15 | 5c7da398c7 |
hex | 343ab6c5d0 |
224323356112 has 40 divisors (see below), whose sum is σ = 460246881600. Its totient is φ = 105551519232.
The previous prime is 224323356067. The next prime is 224323356137. The reversal of 224323356112 is 211653323422.
224323356112 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (34).
It is a congruent number.
It is an unprimeable number.
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, 2518189 + ... + 2605747.
It is an arithmetic number, because the mean of its divisors is an integer number (11506172040).
Almost surely, 2224323356112 is an apocalyptic number.
It is an amenable number.
224323356112 is an abundant number, since it is smaller than the sum of its proper divisors (235923525488).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
224323356112 is a wasteful number, since it uses less digits than its factorization.
224323356112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 97003 (or 96997 counting only the distinct ones).
The product of its digits is 51840, while the sum is 34.
Adding to 224323356112 its reverse (211653323422), we get a palindrome (435976679534).
The spelling of 224323356112 in words is "two hundred twenty-four billion, three hundred twenty-three million, three hundred fifty-six thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •