Base | Representation |
---|---|
bin | 101101111100111100011110… |
… | …101100100001001011101011 |
3 | 222111120120221111112012010202 |
4 | 231330330132230201023223 |
5 | 202442202202440200021 |
6 | 1553455314535502415 |
7 | 60366154246156514 |
oct | 5574743654411353 |
9 | 874516844465122 |
10 | 202100201100011 |
11 | 59439239863695 |
12 | 1a800458527a0b |
13 | 889cc75bb3876 |
14 | 37c99b8121a0b |
15 | 1857153c7ba0b |
hex | b7cf1eb212eb |
202100201100011 has 4 divisors (see below), whose sum is σ = 202102919145792. Its totient is φ = 202097483054232.
The previous prime is 202100201099963. The next prime is 202100201100013. The reversal of 202100201100011 is 110001102001202.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-202100201100011 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 202100201099965 and 202100201100001.
It is not an unprimeable number, because it can be changed into a prime (202100201100013) 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, 1358911355 + ... + 1359060068.
It is an arithmetic number, because the mean of its divisors is an integer number (50525729786448).
Almost surely, 2202100201100011 is an apocalyptic number.
202100201100011 is a deficient number, since it is larger than the sum of its proper divisors (2718045781).
202100201100011 is an equidigital number, since it uses as much as digits as its factorization.
202100201100011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2718045780.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 202100201100011 its reverse (110001102001202), we get a palindrome (312101303101213).
The spelling of 202100201100011 in words is "two hundred two trillion, one hundred billion, two hundred one million, one hundred thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •