Base | Representation |
---|---|
bin | 11110000010010011110… |
… | …10000001111100010000 |
3 | 10122122212002110201011021 |
4 | 33001021322001330100 |
5 | 113402100204200422 |
6 | 2110035313325224 |
7 | 134363501053006 |
oct | 17011172017420 |
9 | 3578762421137 |
10 | 1032032100112 |
11 | 368756240902 |
12 | 148021566814 |
13 | 76421666b30 |
14 | 37d44704a76 |
15 | 1bca3993dc7 |
hex | f049e81f10 |
1032032100112 has 20 divisors (see below), whose sum is σ = 2153374670860. Its totient is φ = 476322507648.
The previous prime is 1032032100109. The next prime is 1032032100163. The reversal of 1032032100112 is 2110012302301.
It can be written as a sum of positive squares in 2 ways, for example, as 281965248016 + 750066852096 = 531004^2 + 866064^2 .
It is a Harshad number since it is a multiple of its sum of digits (16).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2480846187 + ... + 2480846602.
It is an arithmetic number, because the mean of its divisors is an integer number (107668733543).
Almost surely, 21032032100112 is an apocalyptic number.
It is an amenable number.
1032032100112 is an abundant number, since it is smaller than the sum of its proper divisors (1121342570748).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1032032100112 is a wasteful number, since it uses less digits than its factorization.
1032032100112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4961692810 (or 4961692804 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 16.
Adding to 1032032100112 its reverse (2110012302301), we get a palindrome (3142044402413).
The spelling of 1032032100112 in words is "one trillion, thirty-two billion, thirty-two million, one hundred thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •