Base | Representation |
---|---|
bin | 101101011111110101110000… |
… | …000010101011000101011100 |
3 | 222020111101100210022222112010 |
4 | 231133311300002223011130 |
5 | 202211420011420233200 |
6 | 1545324415541511220 |
7 | 60101520201535443 |
oct | 5537656002530534 |
9 | 866441323288463 |
10 | 200100111102300 |
11 | 58837a87133232 |
12 | 1a5388aa412510 |
13 | 8786489acb616 |
14 | 375ac7b725d5a |
15 | 18200e2e23150 |
hex | b5fd700ab15c |
200100111102300 has 72 divisors (see below), whose sum is σ = 578958471630000. Its totient is φ = 53359831454720.
The previous prime is 200100111102271. The next prime is 200100111102389. The reversal of 200100111102300 is 3201111001002.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 91137826 + ... + 93307574.
It is an arithmetic number, because the mean of its divisors is an integer number (8041089883750).
Almost surely, 2200100111102300 is an apocalyptic number.
200100111102300 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
200100111102300 is an abundant number, since it is smaller than the sum of its proper divisors (378858360527700).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
200100111102300 is a wasteful number, since it uses less digits than its factorization.
200100111102300 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2477175 (or 2477168 counting only the distinct ones).
The product of its (nonzero) digits is 12, while the sum is 12.
Adding to 200100111102300 its reverse (3201111001002), we get a palindrome (203301222103302).
The spelling of 200100111102300 in words is "two hundred trillion, one hundred billion, one hundred eleven million, one hundred two thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •