Base | Representation |
---|---|
bin | 10110110000101111000101… |
… | …001000010010001010100111 |
3 | 111010110001100221002121202222 |
4 | 112300233011020102022213 |
5 | 101110114303133112413 |
6 | 552524040113222555 |
7 | 30041266504532411 |
oct | 2660570510221247 |
9 | 433401327077688 |
10 | 100106110050983 |
11 | 299958433a9a93 |
12 | b289299861a5b |
13 | 43b1c72773a6a |
14 | 1aa123952b9b1 |
15 | b88eca12eb08 |
hex | 5b0bc52122a7 |
100106110050983 has 2 divisors, whose sum is σ = 100106110050984. Its totient is φ = 100106110050982.
The previous prime is 100106110050937. The next prime is 100106110051033. The reversal of 100106110050983 is 389050011601001.
It is a happy number.
It is a weak prime.
It is an emirp because it is prime and its reverse (389050011601001) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-100106110050983 is a prime.
It is a super-2 number, since 2×1001061100509832 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (100106110050283) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50053055025491 + 50053055025492.
It is an arithmetic number, because the mean of its divisors is an integer number (50053055025492).
Almost surely, 2100106110050983 is an apocalyptic number.
100106110050983 is a deficient number, since it is larger than the sum of its proper divisors (1).
100106110050983 is an equidigital number, since it uses as much as digits as its factorization.
100106110050983 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6480, while the sum is 35.
Adding to 100106110050983 its reverse (389050011601001), we get a palindrome (489156121651984).
The spelling of 100106110050983 in words is "one hundred trillion, one hundred six billion, one hundred ten million, fifty thousand, nine hundred eighty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •