Base | Representation |
---|---|
bin | 1011111100111000110… |
… | …1001101000111011000 |
3 | 201121222022111200021201 |
4 | 2333032031031013120 |
5 | 11331000143443000 |
6 | 234154001043544 |
7 | 20556044652553 |
oct | 2771615150730 |
9 | 647868450251 |
10 | 205323031000 |
11 | 7a09355317a |
12 | 339623265b4 |
13 | 16492080769 |
14 | 9d1b02d69a |
15 | 551a93896a |
hex | 2fce34d1d8 |
205323031000 has 64 divisors (see below), whose sum is σ = 481419900000. Its totient is φ = 81964425600.
The previous prime is 205323030977. The next prime is 205323031013. The reversal of 205323031000 is 130323502.
It is a super-2 number, since 2×2053230310002 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 293266 + ... + 704734.
Almost surely, 2205323031000 is an apocalyptic number.
205323031000 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 205323031000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (240709950000).
205323031000 is an abundant number, since it is smaller than the sum of its proper divisors (276096869000).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
205323031000 is a wasteful number, since it uses less digits than its factorization.
205323031000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 411989 (or 411975 counting only the distinct ones).
The product of its (nonzero) digits is 540, while the sum is 19.
Adding to 205323031000 its reverse (130323502), we get a palindrome (205453354502).
The spelling of 205323031000 in words is "two hundred five billion, three hundred twenty-three million, thirty-one thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •