Base | Representation |
---|---|
bin | 110001110001111001… |
… | …0011111100111101001 |
3 | 101012221002212100202021 |
4 | 1203203302133213221 |
5 | 3222413111123344 |
6 | 121035400504441 |
7 | 10503050325511 |
oct | 1434362374751 |
9 | 335832770667 |
10 | 106900879849 |
11 | 4137783a295 |
12 | 18874a7b121 |
13 | a10841c4ba |
14 | 5261778841 |
15 | 2ba9ec4b84 |
hex | 18e3c9f9e9 |
106900879849 has 27 divisors (see below), whose sum is σ = 113152611159. Its totient is φ = 100990478160.
The previous prime is 106900879847. The next prime is 106900879859. The reversal of 106900879849 is 948978009601.
The square root of 106900879849 is 326957.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in only one way, i.e., 77064536025 + 29836343824 = 277605^2 + 172732^2 .
It is not a de Polignac number, because 106900879849 - 21 = 106900879847 is a prime.
It is a super-2 number, since 2×1069008798492 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (106900879847) by changing a digit.
It is a polite number, since it can be written in 26 ways as a sum of consecutive naturals, for example, 537190252 + ... + 537190450.
Almost surely, 2106900879849 is an apocalyptic number.
106900879849 is the 326957-th square number.
106900879849 is the 163479-th centered octagonal number.
It is an amenable number.
106900879849 is a deficient number, since it is larger than the sum of its proper divisors (6251731310).
106900879849 is an frugal number, since it uses more digits than its factorization.
106900879849 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 566 (or 283 counting only the distinct ones).
The product of its (nonzero) digits is 7838208, while the sum is 61.
The spelling of 106900879849 in words is "one hundred six billion, nine hundred million, eight hundred seventy-nine thousand, eight hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •