Base | Representation |
---|---|
bin | 101011101010001001110… |
… | …110110110011111111101 |
3 | 101121211001002122212022020 |
4 | 223222021312312133331 |
5 | 343123402201431310 |
6 | 10214134534510353 |
7 | 426520516325400 |
oct | 53521166663775 |
9 | 11554032585266 |
10 | 3000200030205 |
11 | a5741777a3a4 |
12 | 405560b053b9 |
13 | 189bc10c7b81 |
14 | a52d36c5d37 |
15 | 530970a7170 |
hex | 2ba89db67fd |
3000200030205 has 24 divisors (see below), whose sum is σ = 5584045771872. Its totient is φ = 1371520013472.
The previous prime is 3000200030099. The next prime is 3000200030209. The reversal of 3000200030205 is 5020300020003.
It is not a de Polignac number, because 3000200030205 - 210 = 3000200029181 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3000200030209) 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, 2040951667 + ... + 2040953136.
It is an arithmetic number, because the mean of its divisors is an integer number (232668573828).
Almost surely, 23000200030205 is an apocalyptic number.
3000200030205 is a gapful number since it is divisible by the number (35) formed by its first and last digit.
It is an amenable number.
3000200030205 is a deficient number, since it is larger than the sum of its proper divisors (2583845741667).
3000200030205 is a wasteful number, since it uses less digits than its factorization.
3000200030205 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4081904825 (or 4081904818 counting only the distinct ones).
The product of its (nonzero) digits is 180, while the sum is 15.
Adding to 3000200030205 its reverse (5020300020003), we get a palindrome (8020500050208).
The spelling of 3000200030205 in words is "three trillion, two hundred million, thirty thousand, two hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •