Base | Representation |
---|---|
bin | 11110101111000011001… |
… | …010011011011010110000 |
3 | 21110220201002212010220002 |
4 | 132233003022123122300 |
5 | 234101041411430300 |
6 | 4254141542205132 |
7 | 305410613156522 |
oct | 36570312333260 |
9 | 7426632763802 |
10 | 2112103233200 |
11 | 744813238154 |
12 | 2a140b1237a8 |
13 | 12422a71195c |
14 | 74325121a12 |
15 | 39e19a7a5d5 |
hex | 1ebc329b6b0 |
2112103233200 has 120 divisors (see below), whose sum is σ = 5221264161456. Its totient is φ = 820693120000.
The previous prime is 2112103233193. The next prime is 2112103233223. The reversal of 2112103233200 is 23323012112.
It is a Harshad number since it is a multiple of its sum of digits (20).
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, 1647995 + ... + 2634405.
Almost surely, 22112103233200 is an apocalyptic number.
2112103233200 is a gapful number since it is divisible by the number (20) 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 2112103233200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2610632080728).
2112103233200 is an abundant number, since it is smaller than the sum of its proper divisors (3109160928256).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2112103233200 is a wasteful number, since it uses less digits than its factorization.
2112103233200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 986583 (or 986572 counting only the distinct ones).
The product of its (nonzero) digits is 432, while the sum is 20.
Adding to 2112103233200 its reverse (23323012112), we get a palindrome (2135426245312).
The spelling of 2112103233200 in words is "two trillion, one hundred twelve billion, one hundred three million, two hundred thirty-three thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •