Base | Representation |
---|---|
bin | 10110111101101111100101… |
… | …000111110100111111001101 |
3 | 111020121111122122201221200212 |
4 | 112331233211013310333031 |
5 | 101214240444444444244 |
6 | 554450432013132205 |
7 | 30163003103661161 |
oct | 2675574507647715 |
9 | 436544578657625 |
10 | 100999999999949 |
11 | 2a1aa94aa32026 |
12 | b3b258778a065 |
13 | 444834a41174b |
14 | 1ad25d7258ca1 |
15 | ba2396035d9e |
hex | 5bdbe51f4fcd |
100999999999949 has 2 divisors, whose sum is σ = 100999999999950. Its totient is φ = 100999999999948.
The previous prime is 100999999999931. The next prime is 101000000000117. The reversal of 100999999999949 is 949999999999001.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 54987519437449 + 46012480562500 = 7415357^2 + 6783250^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-100999999999949 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (100999999999909) 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 as a sum of consecutive naturals, namely, 50499999999974 + 50499999999975.
It is an arithmetic number, because the mean of its divisors is an integer number (50499999999975).
Almost surely, 2100999999999949 is an apocalyptic number.
It is an amenable number.
100999999999949 is a deficient number, since it is larger than the sum of its proper divisors (1).
100999999999949 is an equidigital number, since it uses as much as digits as its factorization.
100999999999949 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 125524238436, while the sum is 104.
The spelling of 100999999999949 in words is "one hundred trillion, nine hundred ninety-nine billion, nine hundred ninety-nine million, nine hundred ninety-nine thousand, nine hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •