Base | Representation |
---|---|
bin | 101101110000001011101000… |
… | …000000101001001000101000 |
3 | 222101110202000112110001120022 |
4 | 231300023220000221020220 |
5 | 202333314412214101300 |
6 | 1551544342024020012 |
7 | 60245614154322212 |
oct | 5560135000511050 |
9 | 871422015401508 |
10 | 201223110300200 |
11 | 59130272985a9a |
12 | 1a69a478601608 |
13 | 8838347744921 |
14 | 379937154d5b2 |
15 | 183e41cac6285 |
hex | b702e8029228 |
201223110300200 has 96 divisors (see below), whose sum is σ = 508353121056000. Its totient is φ = 73793194905600.
The previous prime is 201223110300097. The next prime is 201223110300217. The reversal of 201223110300200 is 2003011322102.
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 23 ways as a sum of consecutive naturals, for example, 853970105 + ... + 854205704.
It is an arithmetic number, because the mean of its divisors is an integer number (5295345011000).
Almost surely, 2201223110300200 is an apocalyptic number.
201223110300200 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
201223110300200 is an abundant number, since it is smaller than the sum of its proper divisors (307130010755800).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
201223110300200 is a wasteful number, since it uses less digits than its factorization.
201223110300200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1708175875 (or 1708175866 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 17.
Adding to 201223110300200 its reverse (2003011322102), we get a palindrome (203226121622302).
The spelling of 201223110300200 in words is "two hundred one trillion, two hundred twenty-three billion, one hundred ten million, three hundred thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •