Base | Representation |
---|---|
bin | 1011110010100001101… |
… | …1111000010011011000 |
3 | 201100210111020112222110 |
4 | 2330220123320103120 |
5 | 11304301204010211 |
6 | 233014010552320 |
7 | 20430114255504 |
oct | 2745033702330 |
9 | 640714215873 |
10 | 202541860056 |
11 | 78996666298 |
12 | 33306a386a0 |
13 | 1613ab16993 |
14 | 9b3590b304 |
15 | 54066bcea6 |
hex | 2f286f84d8 |
202541860056 has 32 divisors (see below), whose sum is σ = 506378995200. Its totient is φ = 67510707360.
The previous prime is 202541860007. The next prime is 202541860057. The reversal of 202541860056 is 650068145202.
202541860056 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a junction number, because it is equal to n+sod(n) for n = 202541859996 and 202541860023.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (202541860057) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 335905 + ... + 719663.
It is an arithmetic number, because the mean of its divisors is an integer number (15824343600).
Almost surely, 2202541860056 is an apocalyptic number.
It is an amenable number.
202541860056 is an abundant number, since it is smaller than the sum of its proper divisors (303837135144).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
202541860056 is a wasteful number, since it uses less digits than its factorization.
202541860056 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 405759 (or 405755 counting only the distinct ones).
The product of its (nonzero) digits is 115200, while the sum is 39.
The spelling of 202541860056 in words is "two hundred two billion, five hundred forty-one million, eight hundred sixty thousand, fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •