Base | Representation |
---|---|
bin | 1101100011100011000… |
… | …0110111010100000100 |
3 | 211021002211212120200210 |
4 | 3120320300313110010 |
5 | 12303414411130211 |
6 | 254552302435420 |
7 | 22552666110000 |
oct | 3307060672404 |
9 | 737084776623 |
10 | 232880567556 |
11 | 8a84501127a |
12 | 39173292b70 |
13 | 18c64410000 |
14 | b3b2d23700 |
15 | 60cedee9a6 |
hex | 3638c37504 |
232880567556 has 300 divisors, whose sum is σ = 689165972432. Its totient is φ = 61202022336.
The previous prime is 232880567539. The next prime is 232880567641. The reversal of 232880567556 is 655765088232.
It is a junction number, because it is equal to n+sod(n) for n = 232880567496 and 232880567505.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 99 ways as a sum of consecutive naturals, for example, 822899391 + ... + 822899673.
Almost surely, 2232880567556 is an apocalyptic number.
232880567556 is a gapful number since it is divisible by the number (26) 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 232880567556, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (344582986216).
232880567556 is an abundant number, since it is smaller than the sum of its proper divisors (456285404876).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
232880567556 is an frugal number, since it uses more digits than its factorization.
232880567556 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 370 (or 308 counting only the distinct ones).
The product of its (nonzero) digits is 24192000, while the sum is 57.
The spelling of 232880567556 in words is "two hundred thirty-two billion, eight hundred eighty million, five hundred sixty-seven thousand, five hundred fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •