Base | Representation |
---|---|
bin | 1011101001101001111… |
… | …1111010101100001000 |
3 | 201010122112101122211002 |
4 | 2322122133322230020 |
5 | 11234412100204421 |
6 | 231541423154132 |
7 | 20314110430463 |
oct | 2723237725410 |
9 | 633575348732 |
10 | 200160553736 |
11 | 77984461640 |
12 | 32961445948 |
13 | 15b4b6749a0 |
14 | 998b5562da |
15 | 53175dab0b |
hex | 2e9a7fab08 |
200160553736 has 128 divisors (see below), whose sum is σ = 457693286400. Its totient is φ = 80817696000.
The previous prime is 200160553727. The next prime is 200160553777. The reversal of 200160553736 is 637355061002.
It is a self number, because there is not a number n which added to its sum of digits gives 200160553736.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 6332291 + ... + 6363821.
It is an arithmetic number, because the mean of its divisors is an integer number (3575728800).
Almost surely, 2200160553736 is an apocalyptic number.
200160553736 is a gapful number since it is divisible by the number (26) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 200160553736, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (228846643200).
200160553736 is an abundant number, since it is smaller than the sum of its proper divisors (257532732664).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
200160553736 is a wasteful number, since it uses less digits than its factorization.
200160553736 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 31771 (or 31767 counting only the distinct ones).
The product of its (nonzero) digits is 113400, while the sum is 38.
The spelling of 200160553736 in words is "two hundred billion, one hundred sixty million, five hundred fifty-three thousand, seven hundred thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •