Base | Representation |
---|---|
bin | 101101011110011000100110… |
… | …111010100110010110110000 |
3 | 222020010211012211210122102120 |
4 | 231132120212322212112300 |
5 | 202203300201100014300 |
6 | 1545210435540514240 |
7 | 60061346631313302 |
oct | 5536304672462660 |
9 | 866124184718376 |
10 | 200000100001200 |
11 | 587a9625505774 |
12 | 1a5214389ab980 |
13 | 8779c0bc030a5 |
14 | 37560b1015972 |
15 | 181c6dcc443a0 |
hex | b5e626ea65b0 |
200000100001200 has 120 divisors (see below), whose sum is σ = 640670498893776. Its totient is φ = 53333067648000.
The previous prime is 200000100001153. The next prime is 200000100001231. The reversal of 200000100001200 is 2100001000002.
It is a happy number.
It is a tau number, because it is divible by the number of its divisors (120).
It is a Harshad number since it is a multiple of its sum of digits (6).
It is a super Niven number, because it is divisible the sum of any subset of its (nonzero) digits.
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, 301902330 + ... + 302564070.
Almost surely, 2200000100001200 is an apocalyptic number.
200000100001200 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
200000100001200 is an abundant number, since it is smaller than the sum of its proper divisors (440670398892576).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
200000100001200 is a wasteful number, since it uses less digits than its factorization.
200000100001200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 913623 (or 913612 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 6.
Adding to 200000100001200 its reverse (2100001000002), we get a palindrome (202100101001202).
The spelling of 200000100001200 in words is "two hundred trillion, one hundred million, one thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •