Base | Representation |
---|---|
bin | 10111001101111010010010… |
… | …100110101110101000001101 |
3 | 111101112201101000001102202120 |
4 | 113031322102212232220031 |
5 | 101340441323100333401 |
6 | 1001101052410443153 |
7 | 30336164033124204 |
oct | 2715722246565015 |
9 | 441481330042676 |
10 | 102111012121101 |
11 | 2a59904534a695 |
12 | b55196b4334b9 |
13 | 44c9047799529 |
14 | 1b302b106a23b |
15 | bc121d66c836 |
hex | 5cde929aea0d |
102111012121101 has 4 divisors (see below), whose sum is σ = 136148016161472. Its totient is φ = 68074008080732.
The previous prime is 102111012121067. The next prime is 102111012121189. The reversal of 102111012121101 is 101121210111201.
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 102111012121101 - 213 = 102111012112909 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102111012123101) 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, 17018502020181 + ... + 17018502020186.
It is an arithmetic number, because the mean of its divisors is an integer number (34037004040368).
Almost surely, 2102111012121101 is an apocalyptic number.
It is an amenable number.
102111012121101 is a deficient number, since it is larger than the sum of its proper divisors (34037004040371).
102111012121101 is an equidigital number, since it uses as much as digits as its factorization.
102111012121101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 34037004040370.
The product of its (nonzero) digits is 8, while the sum is 15.
Adding to 102111012121101 its reverse (101121210111201), we get a palindrome (203232222232302).
The spelling of 102111012121101 in words is "one hundred two trillion, one hundred eleven billion, twelve million, one hundred twenty-one thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •