Base | Representation |
---|---|
bin | 1011101001011100000… |
… | …1010110100111010001 |
3 | 201010111110121111021000 |
4 | 2322113001112213101 |
5 | 11234302131210001 |
6 | 231531540452213 |
7 | 20312501502231 |
oct | 2722701264721 |
9 | 633443544230 |
10 | 200102210001 |
11 | 77954532081 |
12 | 329459aa069 |
13 | 15b3c557875 |
14 | 99838c9cc1 |
15 | 5312413a86 |
hex | 2e970569d1 |
200102210001 has 64 divisors (see below), whose sum is σ = 312733347840. Its totient is φ = 126207227520.
The previous prime is 200102209949. The next prime is 200102210017. The reversal of 200102210001 is 100012201002.
200102210001 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 200102210001 - 27 = 200102209873 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is not an unprimeable number, because it can be changed into a prime (200102210401) by changing a digit.
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 63 ways as a sum of consecutive naturals, for example, 24072636 + ... + 24080946.
It is an arithmetic number, because the mean of its divisors is an integer number (4886458560).
Almost surely, 2200102210001 is an apocalyptic number.
It is an amenable number.
200102210001 is a deficient number, since it is larger than the sum of its proper divisors (112631137839).
200102210001 is a wasteful number, since it uses less digits than its factorization.
200102210001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8763 (or 8757 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 9.
Adding to 200102210001 its reverse (100012201002), we get a palindrome (300114411003).
The spelling of 200102210001 in words is "two hundred billion, one hundred two million, two hundred ten thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •