Base | Representation |
---|---|
bin | 101101111011101001011111… |
… | …110111001011011000000110 |
3 | 222111021001221220021102022002 |
4 | 231323221133313023120012 |
5 | 202434222213111200402 |
6 | 1553350341312105302 |
7 | 60356551244155466 |
oct | 5573513767133006 |
9 | 874231856242262 |
10 | 202011100100102 |
11 | 59404476651687 |
12 | 1a7a7130835232 |
13 | 88947463c7b07 |
14 | 37c556479dba6 |
15 | 1854b8b7d0602 |
hex | b7ba5fdcb606 |
202011100100102 has 8 divisors (see below), whose sum is σ = 303033570001200. Its totient is φ = 100999910099704.
The previous prime is 202011100100099. The next prime is 202011100100107. The reversal of 202011100100102 is 201001001110202.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (202011100100107) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2819930402 + ... + 2820002037.
It is an arithmetic number, because the mean of its divisors is an integer number (37879196250150).
Almost surely, 2202011100100102 is an apocalyptic number.
202011100100102 is a deficient number, since it is larger than the sum of its proper divisors (101022469901098).
202011100100102 is a wasteful number, since it uses less digits than its factorization.
202011100100102 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5639950350.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 202011100100102 its reverse (201001001110202), we get a palindrome (403012101210304).
It can be divided in two parts, 202011100 and 100102, that added together give a palindrome (202111202).
The spelling of 202011100100102 in words is "two hundred two trillion, eleven billion, one hundred million, one hundred thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •