Base | Representation |
---|---|
bin | 1101100001001000001… |
… | …1011000010110010000 |
3 | 211012102120210201110102 |
4 | 3120102003120112100 |
5 | 12301102131010112 |
6 | 254404022351532 |
7 | 22530621602555 |
oct | 3302203302620 |
9 | 735376721412 |
10 | 232231110032 |
11 | 8a541453219 |
12 | 3901188b5a8 |
13 | 18b8c9b8c0c |
14 | b350984a2c |
15 | 6092db2bc2 |
hex | 36120d8590 |
232231110032 has 60 divisors (see below), whose sum is σ = 470834346444. Its totient is φ = 110955356160.
The previous prime is 232231110029. The next prime is 232231110053. The reversal of 232231110032 is 230011132232.
It can be written as a sum of positive squares in 2 ways, for example, as 213891450256 + 18339659776 = 462484^2 + 135424^2 .
It is a junction number, because it is equal to n+sod(n) for n = 232231109986 and 232231110013.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 8730032 + ... + 8756592.
Almost surely, 2232231110032 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 232231110032, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (235417173222).
232231110032 is an abundant number, since it is smaller than the sum of its proper divisors (238603236412).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
232231110032 is a wasteful number, since it uses less digits than its factorization.
232231110032 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 27648 (or 27619 counting only the distinct ones).
The product of its (nonzero) digits is 432, while the sum is 20.
Adding to 232231110032 its reverse (230011132232), we get a palindrome (462242242264).
The spelling of 232231110032 in words is "two hundred thirty-two billion, two hundred thirty-one million, one hundred ten thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •