Base | Representation |
---|---|
bin | 1011101001000011110… |
… | …0010000010001100101 |
3 | 201010020100200100120222 |
4 | 2322100330100101211 |
5 | 11234100023210041 |
6 | 231513454334125 |
7 | 20310122510213 |
oct | 2722074202145 |
9 | 633210610528 |
10 | 200000210021 |
11 | 779019a4a77 |
12 | 329177ba345 |
13 | 15b24393951 |
14 | 9974137cb3 |
15 | 53084b674b |
hex | 2e90f10465 |
200000210021 has 4 divisors (see below), whose sum is σ = 200027536044. Its totient is φ = 199972884000.
The previous prime is 200000209993. The next prime is 200000210027. The reversal of 200000210021 is 120012000002.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 1498773796 + 198501436225 = 38714^2 + 445535^2 .
It is a cyclic number.
It is not a de Polignac number, because 200000210021 - 26 = 200000209957 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 200000209990 and 200000210008.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (200000210027) 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, 13652030 + ... + 13666671.
It is an arithmetic number, because the mean of its divisors is an integer number (50006884011).
Almost surely, 2200000210021 is an apocalyptic number.
It is an amenable number.
200000210021 is a deficient number, since it is larger than the sum of its proper divisors (27326023).
200000210021 is an equidigital number, since it uses as much as digits as its factorization.
200000210021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 27326022.
The product of its (nonzero) digits is 8, while the sum is 8.
Adding to 200000210021 its reverse (120012000002), we get a palindrome (320012210023).
The spelling of 200000210021 in words is "two hundred billion, two hundred ten thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •