Base | Representation |
---|---|
bin | 101101111011101010100001… |
… | …011111100010100110010101 |
3 | 222111021011210122012002102120 |
4 | 231323222201133202212111 |
5 | 202434231442001400041 |
6 | 1553351042444330153 |
7 | 60356620444312362 |
oct | 5573524137424625 |
9 | 874234718162376 |
10 | 202012201200021 |
11 | 59404991148313 |
12 | 1a7a7399543959 |
13 | 8894890572324 |
14 | 37c562ab07469 |
15 | 1854c032d2366 |
hex | b7baa17e2995 |
202012201200021 has 4 divisors (see below), whose sum is σ = 269349601600032. Its totient is φ = 134674800800012.
The previous prime is 202012201200011. The next prime is 202012201200023. The reversal of 202012201200021 is 120002102210202.
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 202012201200021 - 211 = 202012201197973 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (202012201200023) 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, 33668700200001 + ... + 33668700200006.
It is an arithmetic number, because the mean of its divisors is an integer number (67337400400008).
Almost surely, 2202012201200021 is an apocalyptic number.
It is an amenable number.
202012201200021 is a deficient number, since it is larger than the sum of its proper divisors (67337400400011).
202012201200021 is an equidigital number, since it uses as much as digits as its factorization.
202012201200021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 67337400400010.
The product of its (nonzero) digits is 64, while the sum is 15.
Adding to 202012201200021 its reverse (120002102210202), we get a palindrome (322014303410223).
The spelling of 202012201200021 in words is "two hundred two trillion, twelve billion, two hundred one million, two hundred thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •