Base | Representation |
---|---|
bin | 1100111110111100110… |
… | …0000101100011100000 |
3 | 210022202011200210201012 |
4 | 3033233030011203200 |
5 | 12123304400131300 |
6 | 250245353400052 |
7 | 22054353612632 |
oct | 3175714054340 |
9 | 708664623635 |
10 | 223056255200 |
11 | 86663493a69 |
12 | 37291109028 |
13 | 18059c4692c |
14 | ab20254a52 |
15 | 5c07697435 |
hex | 33ef3058e0 |
223056255200 has 72 divisors (see below), whose sum is σ = 544623345000. Its totient is φ = 89208204800.
The previous prime is 223056255199. The next prime is 223056255277. The reversal of 223056255200 is 2552650322.
223056255200 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 (32).
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 11 ways as a sum of consecutive naturals, for example, 5980610 + ... + 6017790.
It is an arithmetic number, because the mean of its divisors is an integer number (7564213125).
Almost surely, 2223056255200 is an apocalyptic number.
223056255200 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
223056255200 is an abundant number, since it is smaller than the sum of its proper divisors (321567089800).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
223056255200 is a wasteful number, since it uses less digits than its factorization.
223056255200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 44700 (or 44687 counting only the distinct ones).
The product of its (nonzero) digits is 36000, while the sum is 32.
The spelling of 223056255200 in words is "two hundred twenty-three billion, fifty-six million, two hundred fifty-five thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •