Base | Representation |
---|---|
bin | 101110011111111110001001… |
… | …000010010100010001001100 |
3 | 222211002200202002021221122001 |
4 | 232133332021002110101030 |
5 | 203301121134210304230 |
6 | 2002541143454002044 |
7 | 61035104145602503 |
oct | 5637761102242114 |
9 | 884080662257561 |
10 | 204507166884940 |
11 | 5a187003241117 |
12 | 1ab2aa384a6324 |
13 | 8a15c34c6c7aa |
14 | 38702b1d4583a |
15 | 1899a79e5e0ca |
hex | b9ff8909444c |
204507166884940 has 48 divisors (see below), whose sum is σ = 442095584079744. Its totient is φ = 79407310176000.
The previous prime is 204507166884871. The next prime is 204507166884949. The reversal of 204507166884940 is 49488661705402.
It is not an unprimeable number, because it can be changed into a prime (204507166884949) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 320285511 + ... + 320923390.
It is an arithmetic number, because the mean of its divisors is an integer number (9210324668328).
Almost surely, 2204507166884940 is an apocalyptic number.
204507166884940 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
204507166884940 is an abundant number, since it is smaller than the sum of its proper divisors (237588417194804).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
204507166884940 is a wasteful number, since it uses less digits than its factorization.
204507166884940 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 641209378 (or 641209376 counting only the distinct ones).
The product of its (nonzero) digits is 92897280, while the sum is 64.
The spelling of 204507166884940 in words is "two hundred four trillion, five hundred seven billion, one hundred sixty-six million, eight hundred eighty-four thousand, nine hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •