Base | Representation |
---|---|
bin | 1011111001011111111… |
… | …0100100101001000100 |
3 | 201112121220112202211012 |
4 | 2332113332210221010 |
5 | 11322114241204130 |
6 | 233523420501352 |
7 | 20524356514526 |
oct | 2762776445104 |
9 | 645556482735 |
10 | 204413225540 |
11 | 79766a33937 |
12 | 337496aa858 |
13 | 16378732c34 |
14 | 9c7227da16 |
15 | 54b5b21995 |
hex | 2f97fa4a44 |
204413225540 has 12 divisors (see below), whose sum is σ = 429267773676. Its totient is φ = 81765290208.
The previous prime is 204413225501. The next prime is 204413225551. The reversal of 204413225540 is 45522314402.
It can be written as a sum of positive squares in 2 ways, for example, as 48989624896 + 155423600644 = 221336^2 + 394238^2 .
It is a junction number, because it is equal to n+sod(n) for n = 204413225497 and 204413225506.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 5110330619 + ... + 5110330658.
It is an arithmetic number, because the mean of its divisors is an integer number (35772314473).
Almost surely, 2204413225540 is an apocalyptic number.
204413225540 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
204413225540 is an abundant number, since it is smaller than the sum of its proper divisors (224854548136).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
204413225540 is a wasteful number, since it uses less digits than its factorization.
204413225540 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10220661286 (or 10220661284 counting only the distinct ones).
The product of its (nonzero) digits is 38400, while the sum is 32.
Adding to 204413225540 its reverse (45522314402), we get a palindrome (249935539942).
The spelling of 204413225540 in words is "two hundred four billion, four hundred thirteen million, two hundred twenty-five thousand, five hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •