Base | Representation |
---|---|
bin | 111101011110111000… |
… | …1111110001001100000 |
3 | 110121210121101222020102 |
4 | 1322331301332021200 |
5 | 4130400422343240 |
6 | 140353301401532 |
7 | 12352621041656 |
oct | 1727561761140 |
9 | 417717358212 |
10 | 132033012320 |
11 | 50aa4214400 |
12 | 217097092a8 |
13 | c5b2139cc1 |
14 | 65674b8dd6 |
15 | 367b597815 |
hex | 1ebdc7e260 |
132033012320 has 72 divisors (see below), whose sum is σ = 342863049312. Its totient is φ = 48011997440.
The previous prime is 132033012313. The next prime is 132033012329. The reversal of 132033012320 is 23210330231.
It is a Harshad number since it is a multiple of its sum of digits (20).
It is a junction number, because it is equal to n+sod(n) for n = 132033012292 and 132033012301.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (132033012329) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 3390584 + ... + 3429303.
It is an arithmetic number, because the mean of its divisors is an integer number (4761986796).
Almost surely, 2132033012320 is an apocalyptic number.
132033012320 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
132033012320 is an abundant number, since it is smaller than the sum of its proper divisors (210830036992).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
132033012320 is a wasteful number, since it uses less digits than its factorization.
132033012320 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6819924 (or 6819905 counting only the distinct ones).
The product of its (nonzero) digits is 648, while the sum is 20.
Adding to 132033012320 its reverse (23210330231), we get a palindrome (155243342551).
The spelling of 132033012320 in words is "one hundred thirty-two billion, thirty-three million, twelve thousand, three hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •