Base | Representation |
---|---|
bin | 1011101001111100111… |
… | …1101111101000011101 |
3 | 201010212002021010020220 |
4 | 2322133033233220131 |
5 | 11240042442401341 |
6 | 231553350231553 |
7 | 20316065422125 |
oct | 2723717575035 |
9 | 633762233226 |
10 | 200240200221 |
11 | 77a15411186 |
12 | 329840555b9 |
13 | 15b62010199 |
14 | 9997d69c85 |
15 | 531e5bea66 |
hex | 2e9f3efa1d |
200240200221 has 8 divisors (see below), whose sum is σ = 266990150784. Its totient is φ = 133491858240.
The previous prime is 200240200201. The next prime is 200240200261. The reversal of 200240200221 is 122002042002.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 200240200221 - 213 = 200240192029 is a prime.
It is a super-2 number, since 2×2002402002212 (a number of 23 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 200240200221.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (200240200201) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 73260 + ... + 637061.
It is an arithmetic number, because the mean of its divisors is an integer number (33373768848).
Almost surely, 2200240200221 is an apocalyptic number.
It is an amenable number.
200240200221 is a deficient number, since it is larger than the sum of its proper divisors (66749950563).
200240200221 is an equidigital number, since it uses as much as digits as its factorization.
200240200221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 804291.
The product of its (nonzero) digits is 128, while the sum is 15.
Adding to 200240200221 its reverse (122002042002), we get a palindrome (322242242223).
The spelling of 200240200221 in words is "two hundred billion, two hundred forty million, two hundred thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.150 sec. • engine limits •