Base | Representation |
---|---|
bin | 101101100011000010100100… |
… | …011010001110010101011000 |
3 | 222021021102000112020010001012 |
4 | 231203002210122032111120 |
5 | 202224020411423221240 |
6 | 1550013430331513052 |
7 | 60123434106164030 |
oct | 5543024432162530 |
9 | 867242015203035 |
10 | 200320033023320 |
11 | 58912281344571 |
12 | 1a5734458b8788 |
13 | 87a1137588532 |
14 | 37677815a68c0 |
15 | 1825bb533db65 |
hex | b630a468e558 |
200320033023320 has 64 divisors (see below), whose sum is σ = 515134598503680. Its totient is φ = 68677695225216.
The previous prime is 200320033023317. The next prime is 200320033023329. The reversal of 200320033023320 is 23320330023002.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (200320033023329) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 12442694 + ... + 23568213.
It is an arithmetic number, because the mean of its divisors is an integer number (8048978101620).
Almost surely, 2200320033023320 is an apocalyptic number.
200320033023320 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
200320033023320 is an abundant number, since it is smaller than the sum of its proper divisors (314814565480360).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
200320033023320 is a wasteful number, since it uses less digits than its factorization.
200320033023320 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 36030792 (or 36030788 counting only the distinct ones).
The product of its (nonzero) digits is 3888, while the sum is 23.
Adding to 200320033023320 its reverse (23320330023002), we get a palindrome (223640363046322).
The spelling of 200320033023320 in words is "two hundred trillion, three hundred twenty billion, thirty-three million, twenty-three thousand, three hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •