Base | Representation |
---|---|
bin | 1100111110110010011… |
… | …1100011000010011000 |
3 | 210022122011112102100200 |
4 | 3033230213203002120 |
5 | 12123212324402300 |
6 | 250241213102200 |
7 | 22053321155511 |
oct | 3175447430230 |
9 | 708564472320 |
10 | 223013122200 |
11 | 86641103560 |
12 | 3727a787960 |
13 | 1805102404b |
14 | ab18627a08 |
15 | 5c039c7200 |
hex | 33ec9e3098 |
223013122200 has 144 divisors (see below), whose sum is σ = 817039056600. Its totient is φ = 54063782400.
The previous prime is 223013122187. The next prime is 223013122217. The reversal of 223013122200 is 2221310322.
223013122200 is digitally balanced in base 2 and base 3, because in such bases 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 (18).
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 35 ways as a sum of consecutive naturals, for example, 5611845 + ... + 5651444.
Almost surely, 2223013122200 is an apocalyptic number.
223013122200 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
223013122200 is an abundant number, since it is smaller than the sum of its proper divisors (594025934400).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
223013122200 is a wasteful number, since it uses less digits than its factorization.
223013122200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11263322 (or 11263310 counting only the distinct ones).
The product of its (nonzero) digits is 288, while the sum is 18.
Adding to 223013122200 its reverse (2221310322), we get a palindrome (225234432522).
The spelling of 223013122200 in words is "two hundred twenty-three billion, thirteen million, one hundred twenty-two thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •