Base | Representation |
---|---|
bin | 11110111010011010001… |
… | …101010101101100001000 |
3 | 21112002012012011112110102 |
4 | 132322122031111230020 |
5 | 234301032031012300 |
6 | 4303520155304532 |
7 | 306322105562654 |
oct | 36723215255410 |
9 | 7462165145412 |
10 | 2124301032200 |
11 | 749a02609076 |
12 | 2a385414b148 |
13 | 12542283c9b9 |
14 | 74b6110ba64 |
15 | 3a3d086d0d5 |
hex | 1ee9a355b08 |
2124301032200 has 48 divisors (see below), whose sum is σ = 4939276077780. Its totient is φ = 849672898560.
The previous prime is 2124301032197. The next prime is 2124301032209. The reversal of 2124301032200 is 22301034212.
It can be written as a sum of positive squares in 6 ways, for example, as 1578324866596 + 545976165604 = 1256314^2 + 738902^2 .
It is a Harshad number since it is a multiple of its sum of digits (20).
It is not an unprimeable number, because it can be changed into a prime (2124301032209) 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, 3403664 + ... + 3979136.
Almost surely, 22124301032200 is an apocalyptic number.
2124301032200 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
2124301032200 is an abundant number, since it is smaller than the sum of its proper divisors (2814975045580).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2124301032200 is a wasteful number, since it uses less digits than its factorization.
2124301032200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 593946 (or 593937 counting only the distinct ones).
The product of its (nonzero) digits is 576, while the sum is 20.
Adding to 2124301032200 its reverse (22301034212), we get a palindrome (2146602066412).
The spelling of 2124301032200 in words is "two trillion, one hundred twenty-four billion, three hundred one million, thirty-two thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •