Base | Representation |
---|---|
bin | 10110111111001110101011… |
… | …011010011000101000100010 |
3 | 111020222021012221121021011012 |
4 | 112333032223122120220202 |
5 | 101222424110404013442 |
6 | 555005400230220522 |
7 | 30203246363113100 |
oct | 2677165332305042 |
9 | 436867187537135 |
10 | 101102111001122 |
11 | 2a23a189a2a5a0 |
12 | b40a3244b4742 |
13 | 4454b713914ba |
14 | 1ad75227cac70 |
15 | ba4d7075c582 |
hex | 5bf3ab698a22 |
101102111001122 has 96 divisors (see below), whose sum is σ = 206641029246336. Its totient is φ = 36551188262400.
The previous prime is 101102111001103. The next prime is 101102111001127. The reversal of 101102111001122 is 221100111201101.
It is a Harshad number since it is a multiple of its sum of digits (14).
It is a junction number, because it is equal to n+sod(n) for n = 101102111001097 and 101102111001106.
It is not an unprimeable number, because it can be changed into a prime (101102111001127) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 37550033 + ... + 40152324.
It is an arithmetic number, because the mean of its divisors is an integer number (2152510721316).
Almost surely, 2101102111001122 is an apocalyptic number.
101102111001122 is an abundant number, since it is smaller than the sum of its proper divisors (105538918245214).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101102111001122 is a wasteful number, since it uses less digits than its factorization.
101102111001122 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 77702472 (or 77702465 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 14.
Adding to 101102111001122 its reverse (221100111201101), we get a palindrome (322202222202223).
The spelling of 101102111001122 in words is "one hundred one trillion, one hundred two billion, one hundred eleven million, one thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •