Base | Representation |
---|---|
bin | 10110110000111101111110… |
… | …010100101110110101010111 |
3 | 111010111120122102202212001102 |
4 | 112300331332110232311113 |
5 | 101110400031103012413 |
6 | 552535243024220315 |
7 | 30042404011054346 |
oct | 2660757624566527 |
9 | 433446572685042 |
10 | 100122102000983 |
11 | 299a15aa446797 |
12 | b29040146a69b |
13 | 43b362096bb7a |
14 | 1aa1d153a5b5d |
15 | b89614085458 |
hex | 5b0f7e52ed57 |
100122102000983 has 2 divisors, whose sum is σ = 100122102000984. Its totient is φ = 100122102000982.
The previous prime is 100122102000937. The next prime is 100122102001057. The reversal of 100122102000983 is 389000201221001.
It is a weak prime.
It is an emirp because it is prime and its reverse (389000201221001) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 100122102000983 - 224 = 100122085223767 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (100122102050983) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50061051000491 + 50061051000492.
It is an arithmetic number, because the mean of its divisors is an integer number (50061051000492).
Almost surely, 2100122102000983 is an apocalyptic number.
100122102000983 is a deficient number, since it is larger than the sum of its proper divisors (1).
100122102000983 is an equidigital number, since it uses as much as digits as its factorization.
100122102000983 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1728, while the sum is 29.
Adding to 100122102000983 its reverse (389000201221001), we get a palindrome (489122303221984).
The spelling of 100122102000983 in words is "one hundred trillion, one hundred twenty-two billion, one hundred two million, nine hundred eighty-three", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •