Base | Representation |
---|---|
bin | 1011101001110011111… |
… | …0011010000100010010 |
3 | 201010202102120110222000 |
4 | 2322130332122010102 |
5 | 11240003214213020 |
6 | 231545505454430 |
7 | 20315123531532 |
oct | 2723476320422 |
9 | 633672513860 |
10 | 200202101010 |
11 | 779a595972a |
12 | 32973341416 |
13 | 15b57160882 |
14 | 9992c8d4c2 |
15 | 531b096090 |
hex | 2e9cf9a112 |
200202101010 has 64 divisors (see below), whose sum is σ = 533984088960. Its totient is φ = 53376045120.
The previous prime is 200202100999. The next prime is 200202101023. The reversal of 200202101010 is 10101202002.
200202101010 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 (9).
It is a junction number, because it is equal to n+sod(n) for n = 200202100983 and 200202101001.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1256184 + ... + 1406556.
It is an arithmetic number, because the mean of its divisors is an integer number (8343501390).
Almost surely, 2200202101010 is an apocalyptic number.
200202101010 is an abundant number, since it is smaller than the sum of its proper divisors (333781987950).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
200202101010 is a wasteful number, since it uses less digits than its factorization.
200202101010 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 155320 (or 155314 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 9.
Adding to 200202101010 its reverse (10101202002), we get a palindrome (210303303012).
The spelling of 200202101010 in words is "two hundred billion, two hundred two million, one hundred one thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •