Base | Representation |
---|---|
bin | 11000010001100100… |
… | …00001010001000000 |
3 | 1020122020102222110021 |
4 | 30020302001101000 |
5 | 203142222411000 |
6 | 5553101543224 |
7 | 640644100324 |
oct | 141062012100 |
9 | 36566388407 |
10 | 13032232000 |
11 | 558839a877 |
12 | 2638574b14 |
13 | 12c8c788a8 |
14 | 8b8b59984 |
15 | 5141bc11a |
hex | 308c81440 |
13032232000 has 168 divisors, whose sum is σ = 32852535768. Its totient is φ = 5120640000.
The previous prime is 13032231991. The next prime is 13032232021. The reversal of 13032232000 is 23223031.
It can be written as a sum of positive squares in 4 ways, for example, as 83612736 + 12948619264 = 9144^2 + 113792^2 .
It is a Harshad number since it is a multiple of its sum of digits (16).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 102615937 + ... + 102616063.
Almost surely, 213032232000 is an apocalyptic number.
13032232000 is a gapful number since it is divisible by the number (10) 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 13032232000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (16426267884).
13032232000 is an abundant number, since it is smaller than the sum of its proper divisors (19820303768).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13032232000 is an equidigital number, since it uses as much as digits as its factorization.
13032232000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 382 (or 235 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 16.
Adding to 13032232000 its reverse (23223031), we get a palindrome (13055455031).
The spelling of 13032232000 in words is "thirteen billion, thirty-two million, two hundred thirty-two thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •