Base | Representation |
---|---|
bin | 11110000010110110010… |
… | …00001001000110100100 |
3 | 10122200121020002221221110 |
4 | 33001123020021012210 |
5 | 113403143134342012 |
6 | 2110124113545020 |
7 | 134403606552054 |
oct | 17013310110644 |
9 | 3580536087843 |
10 | 1032321012132 |
11 | 368894331773 |
12 | 1480a2275170 |
13 | 76469481aa7 |
14 | 37d70c2d564 |
15 | 1bcbe01273c |
hex | f05b2091a4 |
1032321012132 has 48 divisors (see below), whose sum is σ = 2410953519744. Its totient is φ = 343792224000.
The previous prime is 1032321012077. The next prime is 1032321012137. The reversal of 1032321012132 is 2312101232301.
It is a junction number, because it is equal to n+sod(n) for n = 1032321012099 and 1032321012108.
It is not an unprimeable number, because it can be changed into a prime (1032321012137) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 80763582 + ... + 80776362.
It is an arithmetic number, because the mean of its divisors is an integer number (50228198328).
Almost surely, 21032321012132 is an apocalyptic number.
1032321012132 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1032321012132 is an abundant number, since it is smaller than the sum of its proper divisors (1378632507612).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1032321012132 is a wasteful number, since it uses less digits than its factorization.
1032321012132 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 18420 (or 18418 counting only the distinct ones).
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 1032321012132 its reverse (2312101232301), we get a palindrome (3344422244433).
The spelling of 1032321012132 in words is "one trillion, thirty-two billion, three hundred twenty-one million, twelve thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •