Base | Representation |
---|---|
bin | 101101011110011010011000… |
… | …010010100111001000000101 |
3 | 222020011000010101222100120020 |
4 | 231132122120102213020011 |
5 | 202203313100020334341 |
6 | 1545211352405525353 |
7 | 60061445026132566 |
oct | 5536323022471005 |
9 | 866130111870506 |
10 | 200002002121221 |
11 | 587aa411179693 |
12 | 1a521889a13859 |
13 | 877a152cc98b1 |
14 | 37562118b216d |
15 | 181c79ec20566 |
hex | b5e6984a7205 |
200002002121221 has 8 divisors (see below), whose sum is σ = 266669804524224. Its totient is φ = 133334433899520.
The previous prime is 200002002121183. The next prime is 200002002121289. The reversal of 200002002121221 is 122121200200002.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 200002002121221 - 27 = 200002002121093 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 200002002121221.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (200002002121121) 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, 56542761 + ... + 59975726.
It is an arithmetic number, because the mean of its divisors is an integer number (33333725565528).
Almost surely, 2200002002121221 is an apocalyptic number.
It is an amenable number.
200002002121221 is a deficient number, since it is larger than the sum of its proper divisors (66667802403003).
200002002121221 is a wasteful number, since it uses less digits than its factorization.
200002002121221 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 117090651.
The product of its (nonzero) digits is 64, while the sum is 15.
Adding to 200002002121221 its reverse (122121200200002), we get a palindrome (322123202321223).
The spelling of 200002002121221 in words is "two hundred trillion, two billion, two million, one hundred twenty-one thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •