Base | Representation |
---|---|
bin | 10111001101110001000100… |
… | …011100111111101101101001 |
3 | 111101111202210222100222201112 |
4 | 113031301010130333231221 |
5 | 101340311033404342301 |
6 | 1001052334115400105 |
7 | 30335363466105410 |
oct | 2715610434775551 |
9 | 441452728328645 |
10 | 102101111012201 |
11 | 2a594924439a64 |
12 | b54ba675b3035 |
13 | 44c812a424c02 |
14 | 1b2da120ca477 |
15 | bc0d3e2e59bb |
hex | 5cdc4473fb69 |
102101111012201 has 4 divisors (see below), whose sum is σ = 116686984013952. Its totient is φ = 87515238010452.
The previous prime is 102101111012179. The next prime is 102101111012273. The reversal of 102101111012201 is 102210111101201.
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 not a de Polignac number, because 102101111012201 - 234 = 102083931143017 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (102101111012101) 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, 7292936500865 + ... + 7292936500878.
It is an arithmetic number, because the mean of its divisors is an integer number (29171746003488).
Almost surely, 2102101111012201 is an apocalyptic number.
It is an amenable number.
102101111012201 is a deficient number, since it is larger than the sum of its proper divisors (14585873001751).
102101111012201 is an equidigital number, since it uses as much as digits as its factorization.
102101111012201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14585873001750.
The product of its (nonzero) digits is 8, while the sum is 14.
Adding to 102101111012201 its reverse (102210111101201), we get a palindrome (204311222113402).
The spelling of 102101111012201 in words is "one hundred two trillion, one hundred one billion, one hundred eleven million, twelve thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •