Base | Representation |
---|---|
bin | 10110110000110100101010… |
… | …001110010101000110001111 |
3 | 111010110121211110022112201011 |
4 | 112300310222032111012033 |
5 | 101110214040340230332 |
6 | 552530510410230051 |
7 | 30041601122606353 |
oct | 2660645216250617 |
9 | 433417743275634 |
10 | 100112101101967 |
11 | 29998338178299 |
12 | b28a490125327 |
13 | 43b26b8a28446 |
14 | 1aa164708b463 |
15 | b8922b09ae47 |
hex | 5b0d2a39518f |
100112101101967 has 2 divisors, whose sum is σ = 100112101101968. Its totient is φ = 100112101101966.
The previous prime is 100112101101941. The next prime is 100112101102031. The reversal of 100112101101967 is 769101101211001.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 100112101101967 - 223 = 100112092713359 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (100112101105967) 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, 50056050550983 + 50056050550984.
It is an arithmetic number, because the mean of its divisors is an integer number (50056050550984).
Almost surely, 2100112101101967 is an apocalyptic number.
100112101101967 is a deficient number, since it is larger than the sum of its proper divisors (1).
100112101101967 is an equidigital number, since it uses as much as digits as its factorization.
100112101101967 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 756, while the sum is 31.
Adding to 100112101101967 its reverse (769101101211001), we get a palindrome (869213202312968).
The spelling of 100112101101967 in words is "one hundred trillion, one hundred twelve billion, one hundred one million, one hundred one thousand, nine hundred sixty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •