Base | Representation |
---|---|
bin | 11101010010111100000… |
… | …101011010011100111000 |
3 | 21010110102101102000121220 |
4 | 131102330011122130320 |
5 | 230441013224331300 |
6 | 4140503523432040 |
7 | 265306656416145 |
oct | 35227405323470 |
9 | 7113371360556 |
10 | 2013200230200 |
11 | 706880056145 |
12 | 286208825620 |
13 | 117ac8271083 |
14 | 6d621a5b3cc |
15 | 3757bcd1da0 |
hex | 1d4bc15a738 |
2013200230200 has 96 divisors (see below), whose sum is σ = 6346699142400. Its totient is φ = 527754175360.
The previous prime is 2013200230183. The next prime is 2013200230219. The reversal of 2013200230200 is 20320023102.
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 2013200230200.
It is a congruent number.
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, 28399632 + ... + 28470431.
It is an arithmetic number, because the mean of its divisors is an integer number (66111449400).
Almost surely, 22013200230200 is an apocalyptic number.
2013200230200 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
2013200230200 is an abundant number, since it is smaller than the sum of its proper divisors (4333498912200).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2013200230200 is a wasteful number, since it uses less digits than its factorization.
2013200230200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 56870141 (or 56870132 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 15.
Adding to 2013200230200 its reverse (20320023102), we get a palindrome (2033520253302).
The spelling of 2013200230200 in words is "two trillion, thirteen billion, two hundred million, two hundred thirty thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •