Base | Representation |
---|---|
bin | 10110110000101011011100… |
… | …001100101011000011111001 |
3 | 111010102200021120121122211111 |
4 | 112300223130030223003321 |
5 | 101110033302220011301 |
6 | 552522152232400321 |
7 | 30041100612556144 |
oct | 2660533414530371 |
9 | 433380246548744 |
10 | 100102202110201 |
11 | 29994118483265 |
12 | b288588b460a1 |
13 | 43b179bc45675 |
14 | 1aa0d884dd05b |
15 | b88d4bee1551 |
hex | 5b0adc32b0f9 |
100102202110201 has 4 divisors (see below), whose sum is σ = 100207906654032. Its totient is φ = 99996497566372.
The previous prime is 100102202110177. The next prime is 100102202110213. The reversal of 100102202110201 is 102011202201001.
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 100102202110201 - 215 = 100102202077433 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (100102202117201) 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, 52852270495 + ... + 52852272388.
It is an arithmetic number, because the mean of its divisors is an integer number (25051976663508).
Almost surely, 2100102202110201 is an apocalyptic number.
It is an amenable number.
100102202110201 is a deficient number, since it is larger than the sum of its proper divisors (105704543831).
100102202110201 is an equidigital number, since it uses as much as digits as its factorization.
100102202110201 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 105704543830.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 100102202110201 its reverse (102011202201001), we get a palindrome (202113404311202).
The spelling of 100102202110201 in words is "one hundred trillion, one hundred two billion, two hundred two million, one hundred ten thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •