Base | Representation |
---|---|
bin | 1101100000101001001… |
… | …1011011101001011000 |
3 | 211012002112011112101111 |
4 | 3120022103123221120 |
5 | 12300320340200440 |
6 | 254343100030104 |
7 | 22524452541121 |
oct | 3301223335130 |
9 | 735075145344 |
10 | 232101100120 |
11 | 8a48502490a |
12 | 38b96232334 |
13 | 18b6ba98a86 |
14 | b33b5c1048 |
15 | 60867814ea |
hex | 360a4dba58 |
232101100120 has 128 divisors (see below), whose sum is σ = 540116216640. Its totient is φ = 89723013120.
The previous prime is 232101100103. The next prime is 232101100139. The reversal of 232101100120 is 21001101232.
It is a self number, because there is not a number n which added to its sum of digits gives 232101100120.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 41055214 + ... + 41060866.
Almost surely, 2232101100120 is an apocalyptic number.
232101100120 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 232101100120, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (270058108320).
232101100120 is an abundant number, since it is smaller than the sum of its proper divisors (308015116520).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
232101100120 is a wasteful number, since it uses less digits than its factorization.
232101100120 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6005 (or 6001 counting only the distinct ones).
The product of its (nonzero) digits is 24, while the sum is 13.
Adding to 232101100120 its reverse (21001101232), we get a palindrome (253102201352).
The spelling of 232101100120 in words is "two hundred thirty-two billion, one hundred one million, one hundred thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •