Base | Representation |
---|---|
bin | 101101100001010100101001… |
… | …001110010111010111000001 |
3 | 222020212010100202102001010102 |
4 | 231201110221032113113001 |
5 | 202220102200030400001 |
6 | 1545443310301412145 |
7 | 60112055150555354 |
oct | 5541245116272701 |
9 | 866763322361112 |
10 | 200202002200001 |
11 | 58877212a93a9a |
12 | 1a5545a556a055 |
13 | 8792c77345889 |
14 | 3761b859b429b |
15 | 1822aa81ace6b |
hex | b615293975c1 |
200202002200001 has 8 divisors (see below), whose sum is σ = 200335089240000. Its totient is φ = 200068946309200.
The previous prime is 200202002199943. The next prime is 200202002200021. The reversal of 200202002200001 is 100002200202002.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-200202002200001 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (200202002200021) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 5078426 + ... + 20644476.
It is an arithmetic number, because the mean of its divisors is an integer number (25041886155000).
Almost surely, 2200202002200001 is an apocalyptic number.
It is an amenable number.
200202002200001 is a deficient number, since it is larger than the sum of its proper divisors (133087039999).
200202002200001 is a wasteful number, since it uses less digits than its factorization.
200202002200001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15574599.
The product of its (nonzero) digits is 32, while the sum is 11.
Adding to 200202002200001 its reverse (100002200202002), we get a palindrome (300204202402003).
The spelling of 200202002200001 in words is "two hundred trillion, two hundred two billion, two million, two hundred thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •