Base | Representation |
---|---|
bin | 101110100100001111100… |
… | …101011111100001011000 |
3 | 102022220210100100211110220 |
4 | 232210033211133201120 |
5 | 404412111100402300 |
6 | 10450022033240040 |
7 | 450123166146555 |
oct | 56441745374130 |
9 | 12286710324426 |
10 | 3200012122200 |
11 | 1024132467523 |
12 | 438225703020 |
13 | 1a29b550487a |
14 | b0c4a851a2c |
15 | 5838dcaeda0 |
hex | 2e90f95f858 |
3200012122200 has 96 divisors (see below), whose sum is σ = 9937848378960. Its totient is φ = 851804454400.
The previous prime is 3200012122193. The next prime is 3200012122201. The reversal of 3200012122200 is 22212100023.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a self number, because there is not a number n which added to its sum of digits gives 3200012122200.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3200012122201) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 4453371 + ... + 5121770.
Almost surely, 23200012122200 is an apocalyptic number.
3200012122200 is a gapful number since it is divisible by the number (30) formed by its first and last digit.
It is an amenable number.
3200012122200 is an abundant number, since it is smaller than the sum of its proper divisors (6737836256760).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3200012122200 is a wasteful number, since it uses less digits than its factorization.
3200012122200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 9575717 (or 9575708 counting only the distinct ones).
The product of its (nonzero) digits is 96, while the sum is 15.
Adding to 3200012122200 its reverse (22212100023), we get a palindrome (3222224222223).
The spelling of 3200012122200 in words is "three trillion, two hundred billion, twelve million, one hundred twenty-two thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •