Base | Representation |
---|---|
bin | 101110100111110101… |
… | …1010110001110101101 |
3 | 100120102121100100021221 |
4 | 1131033223112032231 |
5 | 3120021434323432 |
6 | 113554524423341 |
7 | 10143043360411 |
oct | 1351753261655 |
9 | 316377310257 |
10 | 100121011117 |
11 | 39508778596 |
12 | 174a23a7b51 |
13 | 95978cb95a |
14 | 4bbb160d41 |
15 | 290eb8eb97 |
hex | 174fad63ad |
100121011117 has 2 divisors, whose sum is σ = 100121011118. Its totient is φ = 100121011116.
The previous prime is 100121011103. The next prime is 100121011129. The reversal of 100121011117 is 711110121001.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 100120983561 + 27556 = 316419^2 + 166^2 .
It is a cyclic number.
It is not a de Polignac number, because 100121011117 - 223 = 100112622509 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 100121011117.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (100121011717) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50060505558 + 50060505559.
It is an arithmetic number, because the mean of its divisors is an integer number (50060505559).
Almost surely, 2100121011117 is an apocalyptic number.
It is an amenable number.
100121011117 is a deficient number, since it is larger than the sum of its proper divisors (1).
100121011117 is an equidigital number, since it uses as much as digits as its factorization.
100121011117 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 14, while the sum is 16.
Adding to 100121011117 its reverse (711110121001), we get a palindrome (811231132118).
The spelling of 100121011117 in words is "one hundred billion, one hundred twenty-one million, eleven thousand, one hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •