Base | Representation |
---|---|
bin | 11011101010000… |
… | …11000101100010 |
3 | 121011120100000000 |
4 | 31311003011202 |
5 | 433343310312 |
6 | 35004440430 |
7 | 5515024143 |
oct | 1565030542 |
9 | 534510000 |
10 | 232010082 |
11 | 109a66677 |
12 | 65849116 |
13 | 390b4195 |
14 | 22b55aca |
15 | 1557dadc |
hex | dd43162 |
232010082 has 36 divisors (see below), whose sum is σ = 522025686. Its totient is φ = 77332320.
The previous prime is 232010057. The next prime is 232010087. The reversal of 232010082 is 280010232.
It is a happy number.
It can be written as a sum of positive squares in only one way, i.e., 214944921 + 17065161 = 14661^2 + 4131^2 .
It is a Harshad number since it is a multiple of its sum of digits (18).
It is not an unprimeable number, because it can be changed into a prime (232010087) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 17 ways as a sum of consecutive naturals, for example, 4282 + ... + 21962.
Almost surely, 2232010082 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 232010082, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (261012843).
232010082 is an abundant number, since it is smaller than the sum of its proper divisors (290015604).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
232010082 is an frugal number, since it uses more digits than its factorization.
232010082 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17707 (or 17686 counting only the distinct ones).
The product of its (nonzero) digits is 192, while the sum is 18.
The square root of 232010082 is about 15231.8771659963. The cubic root of 232010082 is about 614.4722658985.
The spelling of 232010082 in words is "two hundred thirty-two million, ten thousand, eighty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •