Base | Representation |
---|---|
bin | 1011101001011101111… |
… | …1011111010110100000 |
3 | 201010112000110212011201 |
4 | 2322113133133112200 |
5 | 11234311142010422 |
6 | 231532422050544 |
7 | 20312625604513 |
oct | 2722737372640 |
9 | 633460425151 |
10 | 200110110112 |
11 | 77958a385a0 |
12 | 32948579a54 |
13 | 15b410926a3 |
14 | 9984984d7a |
15 | 5312e74727 |
hex | 2e977df5a0 |
200110110112 has 24 divisors (see below), whose sum is σ = 429781941792. Its totient is φ = 90959140800.
The previous prime is 200110110097. The next prime is 200110110127. The reversal of 200110110112 is 211011011002.
It is an interprime number because it is at equal distance from previous prime (200110110097) and next prime (200110110127).
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 3 ways as a sum of consecutive naturals, for example, 284246964 + ... + 284247667.
It is an arithmetic number, because the mean of its divisors is an integer number (17907580908).
Almost surely, 2200110110112 is an apocalyptic number.
200110110112 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
It is an amenable number.
200110110112 is an abundant number, since it is smaller than the sum of its proper divisors (229671831680).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
200110110112 is a wasteful number, since it uses less digits than its factorization.
200110110112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 568494652 (or 568494644 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 10.
Adding to 200110110112 its reverse (211011011002), we get a palindrome (411121121114).
The spelling of 200110110112 in words is "two hundred billion, one hundred ten million, one hundred ten thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •