Base | Representation |
---|---|
bin | 1011101011110010001… |
… | …1110110110010010100 |
3 | 201012010100200201201200 |
4 | 2322330203312302110 |
5 | 11242044343333133 |
6 | 232114235352500 |
7 | 20334216642546 |
oct | 2727443666224 |
9 | 635110621650 |
10 | 200732011668 |
11 | 78147a95421 |
12 | 32aa08b2730 |
13 | 15c0cb89086 |
14 | 9a033cd696 |
15 | 534c86b913 |
hex | 2ebc8f6c94 |
200732011668 has 18 divisors (see below), whose sum is σ = 507405918474. Its totient is φ = 66910670544.
The previous prime is 200732011637. The next prime is 200732011679. The reversal of 200732011668 is 866110237002.
It can be written as a sum of positive squares in only one way, i.e., 199503368964 + 1228642704 = 446658^2 + 35052^2 .
It is a tau number, because it is divible by the number of its divisors (18).
It is a Harshad number since it is a multiple of its sum of digits (36), and also a Moran number because the ratio is a prime number: 5575889213 = 200732011668 / (2 + 0 + 0 + 7 + 3 + 2 + 0 + 1 + 1 + 6 + 6 + 8).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 2787944571 + ... + 2787944642.
It is an arithmetic number, because the mean of its divisors is an integer number (28189217693).
Almost surely, 2200732011668 is an apocalyptic number.
It is an amenable number.
200732011668 is an abundant number, since it is smaller than the sum of its proper divisors (306673906806).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
200732011668 is a wasteful number, since it uses less digits than its factorization.
200732011668 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5575889223 (or 5575889218 counting only the distinct ones).
The product of its (nonzero) digits is 24192, while the sum is 36.
The spelling of 200732011668 in words is "two hundred billion, seven hundred thirty-two million, eleven thousand, six hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •