Base | Representation |
---|---|
bin | 100000000011111000111… |
… | …110001111010111101000 |
3 | 21210121211211002200112220 |
4 | 200003320332033113220 |
5 | 242044123240233000 |
6 | 4404045233034040 |
7 | 315114233510010 |
oct | 40037076172750 |
9 | 7717754080486 |
10 | 2203200321000 |
11 | 77a410164578 |
12 | 2b6bb33b5920 |
13 | 12c9b79051c3 |
14 | 788c7a00c40 |
15 | 3c49c3b51a0 |
hex | 200f8f8f5e8 |
2203200321000 has 128 divisors (see below), whose sum is σ = 7855982933760. Its totient is φ = 503588640000.
The previous prime is 2203200320957. The next prime is 2203200321013. The reversal of 2203200321000 is 1230023022.
2203200321000 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 52436151 + ... + 52478150.
It is an arithmetic number, because the mean of its divisors is an integer number (61374866670).
Almost surely, 22203200321000 is an apocalyptic number.
2203200321000 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
2203200321000 is an abundant number, since it is smaller than the sum of its proper divisors (5652782612760).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2203200321000 is a wasteful number, since it uses less digits than its factorization.
2203200321000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 104914332 (or 104914318 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 15.
Adding to 2203200321000 its reverse (1230023022), we get a palindrome (2204430344022).
The spelling of 2203200321000 in words is "two trillion, two hundred three billion, two hundred million, three hundred twenty-one thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •