Base | Representation |
---|---|
bin | 10110111111001100110100… |
… | …101111101111011110000111 |
3 | 111020222002002012101120022101 |
4 | 112333030310233233132013 |
5 | 101222411021222022413 |
6 | 555004430510412531 |
7 | 30203146136612500 |
oct | 2677146457573607 |
9 | 436862065346271 |
10 | 101100120110983 |
11 | 2a239358145344 |
12 | b409a69801147 |
13 | 4454914a867b6 |
14 | 1ad73b4223ba7 |
15 | ba4ca5a98edd |
hex | 5bf334bef787 |
101100120110983 has 12 divisors (see below), whose sum is σ = 117606457775280. Its totient is φ = 86657101679232.
The previous prime is 101100120110953. The next prime is 101100120110989. The reversal of 101100120110983 is 389011021001101.
It is not a de Polignac number, because 101100120110983 - 29 = 101100120110471 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101100120110989) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 36761158 + ... + 39415516.
It is an arithmetic number, because the mean of its divisors is an integer number (9800538147940).
Almost surely, 2101100120110983 is an apocalyptic number.
101100120110983 is a deficient number, since it is larger than the sum of its proper divisors (16506337664297).
101100120110983 is an equidigital number, since it uses as much as digits as its factorization.
101100120110983 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3431686 (or 3431679 counting only the distinct ones).
The product of its (nonzero) digits is 432, while the sum is 28.
The spelling of 101100120110983 in words is "one hundred one trillion, one hundred billion, one hundred twenty million, one hundred ten thousand, nine hundred eighty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •