Base | Representation |
---|---|
bin | 1011111000000011100… |
… | …1011011101010100000 |
3 | 201111121220220210002120 |
4 | 2332000321123222200 |
5 | 11320321124031310 |
6 | 233421145144240 |
7 | 20511645255255 |
oct | 2760071335240 |
9 | 644556823076 |
10 | 204026002080 |
11 | 795883a514a |
12 | 3365ba8b080 |
13 | 16316445c24 |
14 | 9c36a8342c |
15 | 5491b33b70 |
hex | 2f80e5baa0 |
204026002080 has 48 divisors (see below), whose sum is σ = 642681908064. Its totient is φ = 54406933760.
The previous prime is 204026002039. The next prime is 204026002111. The reversal of 204026002080 is 80200620402.
It is a tau number, because it is divible by the number of its divisors (48).
It is a Harshad number since it is a multiple of its sum of digits (24).
It is a self number, because there is not a number n which added to its sum of digits gives 204026002080.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 212526606 + ... + 212527565.
It is an arithmetic number, because the mean of its divisors is an integer number (13389206418).
Almost surely, 2204026002080 is an apocalyptic number.
204026002080 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
204026002080 is an abundant number, since it is smaller than the sum of its proper divisors (438655905984).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
204026002080 is a wasteful number, since it uses less digits than its factorization.
204026002080 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 425054189 (or 425054181 counting only the distinct ones).
The product of its (nonzero) digits is 1536, while the sum is 24.
Adding to 204026002080 its reverse (80200620402), we get a palindrome (284226622482).
The spelling of 204026002080 in words is "two hundred four billion, twenty-six million, two thousand, eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •