Base | Representation |
---|---|
bin | 11110000010010011111… |
… | …01100111111010110100 |
3 | 10122122212011020120022201 |
4 | 33001021331213322310 |
5 | 113402100424321400 |
6 | 2110035345434244 |
7 | 134363512055224 |
oct | 17011175477264 |
9 | 3578764216281 |
10 | 1032033042100 |
11 | 368756824605 |
12 | 14802193b984 |
13 | 76421906818 |
14 | 37d448ac084 |
15 | 1bca3acd06a |
hex | f049f67eb4 |
1032033042100 has 36 divisors (see below), whose sum is σ = 2239979211148. Its totient is φ = 412727040000.
The previous prime is 1032033042083. The next prime is 1032033042107. The reversal of 1032033042100 is 12403302301.
It can be written as a sum of positive squares in 6 ways, for example, as 192731536144 + 839301505956 = 439012^2 + 916134^2 .
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1032033042107) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 594711 + ... + 1554910.
Almost surely, 21032033042100 is an apocalyptic number.
1032033042100 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1032033042100 is an abundant number, since it is smaller than the sum of its proper divisors (1207946169048).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1032033042100 is a wasteful number, since it uses less digits than its factorization.
1032033042100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2154436 (or 2154429 counting only the distinct ones).
The product of its (nonzero) digits is 432, while the sum is 19.
Adding to 1032033042100 its reverse (12403302301), we get a palindrome (1044436344401).
The spelling of 1032033042100 in words is "one trillion, thirty-two billion, thirty-three million, forty-two thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •