Base | Representation |
---|---|
bin | 101101100001100110010110… |
… | …001011101111111110011001 |
3 | 222020220221102110010102012011 |
4 | 231201212112023233332121 |
5 | 202220410112041200441 |
6 | 1545500132350545521 |
7 | 60113330165213653 |
oct | 5541462613577631 |
9 | 866827373112164 |
10 | 200221010100121 |
11 | 588842874a575a |
12 | 1a55820b2082a1 |
13 | 87949b631b15a |
14 | 3762a6a2076d3 |
15 | 182331bca8581 |
hex | b619962eff99 |
200221010100121 has 4 divisors (see below), whose sum is σ = 201169924840144. Its totient is φ = 199272095360100.
The previous prime is 200221010100101. The next prime is 200221010100151. The reversal of 200221010100121 is 121001010122002.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 200221010100121 - 221 = 200221008002969 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (200221010100101) 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, 474457369695 + ... + 474457370116.
It is an arithmetic number, because the mean of its divisors is an integer number (50292481210036).
Almost surely, 2200221010100121 is an apocalyptic number.
It is an amenable number.
200221010100121 is a deficient number, since it is larger than the sum of its proper divisors (948914740023).
200221010100121 is an equidigital number, since it uses as much as digits as its factorization.
200221010100121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 948914740022.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 200221010100121 its reverse (121001010122002), we get a palindrome (321222020222123).
The spelling of 200221010100121 in words is "two hundred trillion, two hundred twenty-one billion, ten million, one hundred thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •