Base | Representation |
---|---|
bin | 1011101001000110001… |
… | …0000011101110110000 |
3 | 201010021001022211200101 |
4 | 2322101202003232300 |
5 | 11234110042320422 |
6 | 231514451002144 |
7 | 20310302653465 |
oct | 2722142035660 |
9 | 633231284611 |
10 | 200010120112 |
11 | 77907553630 |
12 | 3291ab99354 |
13 | 15b264535ca |
14 | 997559766c |
15 | 53092c2c27 |
hex | 2e91883bb0 |
200010120112 has 20 divisors (see below), whose sum is σ = 422748663336. Its totient is φ = 90913690880.
The previous prime is 200010120109. The next prime is 200010120127. The reversal of 200010120112 is 211021010002.
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 3 ways as a sum of consecutive naturals, for example, 568210393 + ... + 568210744.
Almost surely, 2200010120112 is an apocalyptic number.
200010120112 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
It is an amenable number.
200010120112 is an abundant number, since it is smaller than the sum of its proper divisors (222738543224).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
200010120112 is a wasteful number, since it uses less digits than its factorization.
200010120112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1136421156 (or 1136421150 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 10.
Adding to 200010120112 its reverse (211021010002), we get a palindrome (411031130114).
The spelling of 200010120112 in words is "two hundred billion, ten million, one hundred twenty thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •