Base | Representation |
---|---|
bin | 1011111011111000100… |
… | …1000010011110101000 |
3 | 201121021112100020221000 |
4 | 2332332021002132220 |
5 | 11324422144102100 |
6 | 234111132115000 |
7 | 20546263010034 |
oct | 2767611023650 |
9 | 647245306830 |
10 | 205053503400 |
11 | 79a653a2099 |
12 | 338a8005a60 |
13 | 1644b291985 |
14 | 9cd330d1c4 |
15 | 5501e48900 |
hex | 2fbe2427a8 |
205053503400 has 96 divisors (see below), whose sum is σ = 706295419200. Its totient is φ = 54680932800.
The previous prime is 205053503383. The next prime is 205053503419. The reversal of 205053503400 is 4305350502.
205053503400 is a `hidden beast` number, since 20 + 50 + 53 + 503 + 40 + 0 = 666.
It is a super-2 number, since 2×2050535034002 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 18981036 + ... + 18991835.
It is an arithmetic number, because the mean of its divisors is an integer number (7357243950).
Almost surely, 2205053503400 is an apocalyptic number.
205053503400 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
205053503400 is an abundant number, since it is smaller than the sum of its proper divisors (501241915800).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
205053503400 is a wasteful number, since it uses less digits than its factorization.
205053503400 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 37972896 (or 37972881 counting only the distinct ones).
The product of its (nonzero) digits is 9000, while the sum is 27.
Adding to 205053503400 its reverse (4305350502), we get a palindrome (209358853902).
The spelling of 205053503400 in words is "two hundred five billion, fifty-three million, five hundred three thousand, four hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •