Base | Representation |
---|---|
bin | 1011101001000100011… |
… | …1101010011111110010 |
3 | 201010020120022022110100 |
4 | 2322101013222133302 |
5 | 11234101304413020 |
6 | 231514042413230 |
7 | 20310160105254 |
oct | 2722107523762 |
9 | 633216268410 |
10 | 200003201010 |
11 | 77903658168 |
12 | 32918801216 |
13 | 15b24ba0172 |
14 | 99746b5cd4 |
15 | 53088a7a90 |
hex | 2e911ea7f2 |
200003201010 has 48 divisors (see below), whose sum is σ = 523452121920. Its totient is φ = 52980976800.
The previous prime is 200003200967. The next prime is 200003201011. The reversal of 200003201010 is 10102300002.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 200003200983 and 200003201001.
It is not an unprimeable number, because it can be changed into a prime (200003201011) 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, 7344880 + ... + 7372059.
It is an arithmetic number, because the mean of its divisors is an integer number (10905252540).
Almost surely, 2200003201010 is an apocalyptic number.
200003201010 is an abundant number, since it is smaller than the sum of its proper divisors (323448920910).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
200003201010 is a wasteful number, since it uses less digits than its factorization.
200003201010 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14717103 (or 14717100 counting only the distinct ones).
The product of its (nonzero) digits is 12, while the sum is 9.
Adding to 200003201010 its reverse (10102300002), we get a palindrome (210105501012).
The spelling of 200003201010 in words is "two hundred billion, three million, two hundred one thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •