Base | Representation |
---|---|
bin | 1011101001011100000… |
… | …0111100010000000101 |
3 | 201010111110102000010202 |
4 | 2322113000330100011 |
5 | 11234302114231041 |
6 | 231531534300245 |
7 | 20312500542353 |
oct | 2722700742005 |
9 | 633443360122 |
10 | 200102102021 |
11 | 77954468a38 |
12 | 32945957685 |
13 | 15b3c51a683 |
14 | 998389c7d3 |
15 | 53123e1a9b |
hex | 2e9703c405 |
200102102021 has 4 divisors (see below), whose sum is σ = 201972215232. Its totient is φ = 198231988812.
The previous prime is 200102101981. The next prime is 200102102029. The reversal of 200102102021 is 120201201002.
It is a happy number.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 200102102021 - 210 = 200102100997 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 200102101993 and 200102102011.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (200102102029) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 935056445 + ... + 935056658.
It is an arithmetic number, because the mean of its divisors is an integer number (50493053808).
Almost surely, 2200102102021 is an apocalyptic number.
It is an amenable number.
200102102021 is a deficient number, since it is larger than the sum of its proper divisors (1870113211).
200102102021 is a wasteful number, since it uses less digits than its factorization.
200102102021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1870113210.
The product of its (nonzero) digits is 16, while the sum is 11.
Adding to 200102102021 its reverse (120201201002), we get a palindrome (320303303023).
The spelling of 200102102021 in words is "two hundred billion, one hundred two million, one hundred two thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •