Base | Representation |
---|---|
bin | 1011101001111000101… |
… | …1001010000010000101 |
3 | 201010210211102122121101 |
4 | 2322132023022002011 |
5 | 11240023342023141 |
6 | 231551505020101 |
7 | 20315456535646 |
oct | 2723613120205 |
9 | 633724378541 |
10 | 200222220421 |
11 | 77a06250743 |
12 | 3297a024631 |
13 | 15b5b386452 |
14 | 99958096cd |
15 | 531cc1c531 |
hex | 2e9e2ca085 |
200222220421 has 4 divisors (see below), whose sum is σ = 204482267712. Its totient is φ = 195962173132.
The previous prime is 200222220377. The next prime is 200222220437. The reversal of 200222220421 is 124022222002.
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 200222220421 - 217 = 200222089349 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (200222220461) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2130023575 + ... + 2130023668.
It is an arithmetic number, because the mean of its divisors is an integer number (51120566928).
Almost surely, 2200222220421 is an apocalyptic number.
It is an amenable number.
200222220421 is a deficient number, since it is larger than the sum of its proper divisors (4260047291).
200222220421 is an equidigital number, since it uses as much as digits as its factorization.
200222220421 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4260047290.
The product of its (nonzero) digits is 512, while the sum is 19.
Adding to 200222220421 its reverse (124022222002), we get a palindrome (324244442423).
The spelling of 200222220421 in words is "two hundred billion, two hundred twenty-two million, two hundred twenty thousand, four hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •