Base | Representation |
---|---|
bin | 1011101001100000011… |
… | …0000100010100011000 |
3 | 201010112201111122110010 |
4 | 2322120012010110120 |
5 | 11234321234114000 |
6 | 231533422521520 |
7 | 20313110554245 |
oct | 2723006042430 |
9 | 633481448403 |
10 | 200120223000 |
11 | 77963715555 |
12 | 3294ba362a0 |
13 | 15b431c3749 |
14 | 99860585cc |
15 | 5313cc0d50 |
hex | 2e98184518 |
200120223000 has 128 divisors (see below), whose sum is σ = 633694763520. Its totient is φ = 52568841600.
The previous prime is 200120222987. The next prime is 200120223001. The reversal of 200120223000 is 322021002.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (200120223001) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 296812 + ... + 698811.
It is an arithmetic number, because the mean of its divisors is an integer number (4950740340).
Almost surely, 2200120223000 is an apocalyptic number.
200120223000 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
200120223000 is an abundant number, since it is smaller than the sum of its proper divisors (433574540520).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
200120223000 is a wasteful number, since it uses less digits than its factorization.
200120223000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 995714 (or 995700 counting only the distinct ones).
The product of its (nonzero) digits is 48, while the sum is 12.
Adding to 200120223000 its reverse (322021002), we get a palindrome (200442244002).
It can be divided in two parts, 2001202 and 23000, that added together give a palindrome (2024202).
The spelling of 200120223000 in words is "two hundred billion, one hundred twenty million, two hundred twenty-three thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •