Base | Representation |
---|---|
bin | 101101011110101100001011… |
… | …010101000110010010111001 |
3 | 222020012211110012121220111121 |
4 | 231132230023111012102321 |
5 | 202204121214134202301 |
6 | 1545224232541225241 |
7 | 60063022422455611 |
oct | 5536541325062271 |
9 | 866184405556447 |
10 | 200021112022201 |
11 | 58807528219088 |
12 | 1a525521862221 |
13 | 877bbaa166602 |
14 | 3757105897a41 |
15 | 181d01c7683a1 |
hex | b5eb0b5464b9 |
200021112022201 has 4 divisors (see below), whose sum is σ = 200025987891712. Its totient is φ = 200016236152692.
The previous prime is 200021112022189. The next prime is 200021112022211. The reversal of 200021112022201 is 102220211120002.
It is a happy number.
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 a de Polignac number, because none of the positive numbers 2k-200021112022201 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (200021112022211) 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, 2437873221 + ... + 2437955266.
It is an arithmetic number, because the mean of its divisors is an integer number (50006496972928).
Almost surely, 2200021112022201 is an apocalyptic number.
It is an amenable number.
200021112022201 is a deficient number, since it is larger than the sum of its proper divisors (4875869511).
200021112022201 is an equidigital number, since it uses as much as digits as its factorization.
200021112022201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4875869510.
The product of its (nonzero) digits is 64, while the sum is 16.
Adding to 200021112022201 its reverse (102220211120002), we get a palindrome (302241323142203).
The spelling of 200021112022201 in words is "two hundred trillion, twenty-one billion, one hundred twelve million, twenty-two thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •