Base | Representation |
---|---|
bin | 101101100000001001001101… |
… | …001111111001001110010010 |
3 | 222020120101021201121210202112 |
4 | 231200021031033321032102 |
5 | 202212240303030431002 |
6 | 1545342152542345322 |
7 | 60103156664131610 |
oct | 5540111517711622 |
9 | 866511251553675 |
10 | 200121002202002 |
11 | 58845927665692 |
12 | 1a54095a88b242 |
13 | 8788438ca478b |
14 | 375bca00cc6b0 |
15 | 182091700d852 |
hex | b6024d3f9392 |
200121002202002 has 8 divisors (see below), whose sum is σ = 343064575203456. Its totient is φ = 85766143800852.
The previous prime is 200121002201941. The next prime is 200121002202041. The reversal of 200121002202002 is 200202200121002.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a Harshad number since it is a multiple of its sum of digits (14), and also a Moran number because the ratio is a prime number: 14294357300143 = 200121002202002 / (2 + 0 + 0 + 1 + 2 + 1 + 0 + 0 + 2 + 2 + 0 + 2 + 0 + 0 + 2).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 7147178650058 + ... + 7147178650085.
It is an arithmetic number, because the mean of its divisors is an integer number (42883071900432).
Almost surely, 2200121002202002 is an apocalyptic number.
200121002202002 is a deficient number, since it is larger than the sum of its proper divisors (142943573001454).
200121002202002 is a wasteful number, since it uses less digits than its factorization.
200121002202002 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14294357300152.
The product of its (nonzero) digits is 64, while the sum is 14.
Adding to 200121002202002 its reverse (200202200121002), we get a palindrome (400323202323004).
The spelling of 200121002202002 in words is "two hundred trillion, one hundred twenty-one billion, two million, two hundred two thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •