Base | Representation |
---|---|
bin | 101101111011011111010110… |
… | …010010100110110110001111 |
3 | 222111020000211101202122202210 |
4 | 231323133112102212312033 |
5 | 202434032403214200421 |
6 | 1553341340050121503 |
7 | 60356014213534662 |
oct | 5573372622466617 |
9 | 874200741678683 |
10 | 202000202100111 |
11 | 593aa893a50a18 |
12 | 1a7a4baab80293 |
13 | 88936ca6643cc |
14 | 37c4c0d2816d9 |
15 | 185474eb8d576 |
hex | b7b7d64a6d8f |
202000202100111 has 8 divisors (see below), whose sum is σ = 269333673375664. Its totient is φ = 134666766112320.
The previous prime is 202000202100107. The next prime is 202000202100149. The reversal of 202000202100111 is 111001202000202.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 202000202100111 - 22 = 202000202100107 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 (202000202100181) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 10717221 + ... + 22778481.
It is an arithmetic number, because the mean of its divisors is an integer number (33666709171958).
Almost surely, 2202000202100111 is an apocalyptic number.
202000202100111 is a deficient number, since it is larger than the sum of its proper divisors (67333471275553).
202000202100111 is a wasteful number, since it uses less digits than its factorization.
202000202100111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 17643881.
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 202000202100111 its reverse (111001202000202), we get a palindrome (313001404100313).
Subtracting from 202000202100111 its reverse (111001202000202), we obtain a palindrome (90999000099909).
The spelling of 202000202100111 in words is "two hundred two trillion, two hundred two million, one hundred thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.095 sec. • engine limits •