Base | Representation |
---|---|
bin | 1101100011111111100… |
… | …0100010100011101000 |
3 | 211021102011122101220210 |
4 | 3120333320202203220 |
5 | 12304141001121300 |
6 | 255012211021120 |
7 | 22555646331303 |
oct | 3307770424350 |
9 | 737364571823 |
10 | 233000020200 |
11 | 8a8a6489872 |
12 | 391a729a7a0 |
13 | 18c830a4a4c |
14 | b3c4b39b3a |
15 | 60da648050 |
hex | 363fe228e8 |
233000020200 has 96 divisors (see below), whose sum is σ = 723002564160. Its totient is φ = 62072908800.
The previous prime is 233000020171. The next prime is 233000020213. The reversal of 233000020200 is 2020000332.
It is a Harshad number since it is a multiple of its sum of digits (12).
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, 430272 + ... + 806928.
It is an arithmetic number, because the mean of its divisors is an integer number (7531276710).
Almost surely, 2233000020200 is an apocalyptic number.
233000020200 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 233000020200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (361501282080).
233000020200 is an abundant number, since it is smaller than the sum of its proper divisors (490002543960).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
233000020200 is a wasteful number, since it uses less digits than its factorization.
233000020200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 377707 (or 377698 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 12.
Adding to 233000020200 its reverse (2020000332), we get a palindrome (235020020532).
The spelling of 233000020200 in words is "two hundred thirty-three billion, twenty thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •