Base | Representation |
---|---|
bin | 101101100000000001001111… |
… | …100001000111000101000000 |
3 | 222020112120012201202221201010 |
4 | 231200001033201013011000 |
5 | 202212120244241210130 |
6 | 1545334220210240520 |
7 | 60102435032353065 |
oct | 5540011741070500 |
9 | 866476181687633 |
10 | 200112450335040 |
11 | 58842239325441 |
12 | 1a53b172886140 |
13 | 87876a5319479 |
14 | 375b6cc40ac6c |
15 | 18205b63520b0 |
hex | b6004f847140 |
200112450335040 has 112 divisors (see below), whose sum is σ = 668796873549120. Its totient is φ = 50554724290560.
The previous prime is 200112450335033. The next prime is 200112450335053. The reversal of 200112450335040 is 40533054211002.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a junction number, because it is equal to n+sod(n) for n = 200112450334989 and 200112450335007.
It is a congruent number.
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 15 ways as a sum of consecutive naturals, for example, 5485520421 + ... + 5485556900.
Almost surely, 2200112450335040 is an apocalyptic number.
200112450335040 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
200112450335040 is an abundant number, since it is smaller than the sum of its proper divisors (468684423214080).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
200112450335040 is a wasteful number, since it uses less digits than its factorization.
200112450335040 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10971077360 (or 10971077350 counting only the distinct ones).
The product of its (nonzero) digits is 14400, while the sum is 30.
The spelling of 200112450335040 in words is "two hundred trillion, one hundred twelve billion, four hundred fifty million, three hundred thirty-five thousand, forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •