Base | Representation |
---|---|
bin | 101101100001010010111110… |
… | …011110010100011010000100 |
3 | 222020211221201221100211120111 |
4 | 231201102332132110122010 |
5 | 202220040013033020400 |
6 | 1545442412442442404 |
7 | 60111662602516540 |
oct | 5541227636243204 |
9 | 866757657324514 |
10 | 200200211220100 |
11 | 58876484030313 |
12 | 1a554185803404 |
13 | 8792a50293360 |
14 | 3761a55ba8a20 |
15 | 1822a00d373ba |
hex | b614be794684 |
200200211220100 has 144 divisors (see below), whose sum is σ = 540200819740288. Its totient is φ = 62706870005760.
The previous prime is 200200211220091. The next prime is 200200211220127. The reversal of 200200211220100 is 1022112002002.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (13).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 112519482 + ... + 114284881.
Almost surely, 2200200211220100 is an apocalyptic number.
200200211220100 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
200200211220100 is an abundant number, since it is smaller than the sum of its proper divisors (340000608520188).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
200200211220100 is a wasteful number, since it uses less digits than its factorization.
200200211220100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 226804494 (or 226804487 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 13.
Adding to 200200211220100 its reverse (1022112002002), we get a palindrome (201222323222102).
The spelling of 200200211220100 in words is "two hundred trillion, two hundred billion, two hundred eleven million, two hundred twenty thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •