Base | Representation |
---|---|
bin | 101110100111100000… |
… | …1010100001110010001 |
3 | 100120101211121120001221 |
4 | 1131033001110032101 |
5 | 3120011124232344 |
6 | 113553452325041 |
7 | 10142550620236 |
oct | 1351701241621 |
9 | 316354546057 |
10 | 100109992849 |
11 | 39502532389 |
12 | 1749a773781 |
13 | 9595541779 |
14 | 4bb98d378d |
15 | 290dc15184 |
hex | 174f054391 |
100109992849 has 2 divisors, whose sum is σ = 100109992850. Its totient is φ = 100109992848.
The previous prime is 100109992811. The next prime is 100109992859. The reversal of 100109992849 is 948299901001.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 63693140625 + 36416852224 = 252375^2 + 190832^2 .
It is a cyclic number.
It is not a de Polignac number, because 100109992849 - 219 = 100109468561 is a prime.
It is a super-2 number, since 2×1001099928492 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 100109992796 and 100109992805.
It is not a weakly prime, because it can be changed into another prime (100109992859) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50054996424 + 50054996425.
It is an arithmetic number, because the mean of its divisors is an integer number (50054996425).
Almost surely, 2100109992849 is an apocalyptic number.
It is an amenable number.
100109992849 is a deficient number, since it is larger than the sum of its proper divisors (1).
100109992849 is an equidigital number, since it uses as much as digits as its factorization.
100109992849 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 419904, while the sum is 52.
The spelling of 100109992849 in words is "one hundred billion, one hundred nine million, nine hundred ninety-two thousand, eight hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •