Base | Representation |
---|---|
bin | 11011100010110… |
… | …10001100110100 |
3 | 121002202212111022 |
4 | 31301122030310 |
5 | 433122244210 |
6 | 34532200312 |
7 | 5503642115 |
oct | 1561321464 |
9 | 532685438 |
10 | 231056180 |
11 | 109474a23 |
12 | 65469098 |
13 | 38b3bc44 |
14 | 2298820c |
15 | 15441155 |
hex | dc5a334 |
231056180 has 48 divisors (see below), whose sum is σ = 517902336. Its totient is φ = 86284800.
The previous prime is 231056179. The next prime is 231056209. The reversal of 231056180 is 81650132.
231056180 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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, 40505 + ... + 45855.
It is an arithmetic number, because the mean of its divisors is an integer number (10789632).
Almost surely, 2231056180 is an apocalyptic number.
231056180 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 231056180, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (258951168).
231056180 is an abundant number, since it is smaller than the sum of its proper divisors (286846156).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
231056180 is a wasteful number, since it uses less digits than its factorization.
231056180 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5504 (or 5502 counting only the distinct ones).
The product of its (nonzero) digits is 1440, while the sum is 26.
The square root of 231056180 is about 15200.5322275241. The cubic root of 231056180 is about 613.6289814667.
The spelling of 231056180 in words is "two hundred thirty-one million, fifty-six thousand, one hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •