Base | Representation |
---|---|
bin | 10110111111001110101011… |
… | …011110101010000100100001 |
3 | 111020222021020000201011111122 |
4 | 112333032223132222010201 |
5 | 101222424111200333441 |
6 | 555005400310222025 |
7 | 30203246405456306 |
oct | 2677165336520441 |
9 | 436867200634448 |
10 | 101102112121121 |
11 | 2a23a18a625011 |
12 | b40a324954915 |
13 | 4454b71694217 |
14 | 1ad75229dd0ad |
15 | ba4d708ce34b |
hex | 5bf3ab7aa121 |
101102112121121 has 16 divisors (see below), whose sum is σ = 101871961344000. Its totient is φ = 100334945576448.
The previous prime is 101102112121111. The next prime is 101102112121177. The reversal of 101102112121121 is 121121211201101.
It is a cyclic number.
It is not a de Polignac number, because 101102112121121 - 218 = 101102111858977 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 101102112121121.
It is not an unprimeable number, because it can be changed into a prime (101102112121111) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 652434176 + ... + 652589118.
It is an arithmetic number, because the mean of its divisors is an integer number (6366997584000).
Almost surely, 2101102112121121 is an apocalyptic number.
It is an amenable number.
101102112121121 is a deficient number, since it is larger than the sum of its proper divisors (769849222879).
101102112121121 is a wasteful number, since it uses less digits than its factorization.
101102112121121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 163568.
The product of its (nonzero) digits is 16, while the sum is 17.
Adding to 101102112121121 its reverse (121121211201101), we get a palindrome (222223323322222).
The spelling of 101102112121121 in words is "one hundred one trillion, one hundred two billion, one hundred twelve million, one hundred twenty-one thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •