Base | Representation |
---|---|
bin | 110001110000010111… |
… | …1110011111011001111 |
3 | 101012210112211112000120 |
4 | 1203200233303323033 |
5 | 3222312030014233 |
6 | 121030335000023 |
7 | 10501560460632 |
oct | 1434057637317 |
9 | 335715745016 |
10 | 106849844943 |
11 | 41350a51a86 |
12 | 1885b969013 |
13 | a0ca99102a |
14 | 5258a91c19 |
15 | 2ba57934b3 |
hex | 18e0bf3ecf |
106849844943 has 4 divisors (see below), whose sum is σ = 142466459928. Its totient is φ = 71233229960.
The previous prime is 106849844887. The next prime is 106849844947. The reversal of 106849844943 is 349448948601.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 349448948601 = 3 ⋅116482982867.
It is a cyclic number.
It is not a de Polignac number, because 106849844943 - 220 = 106848796367 is a prime.
It is a super-2 number, since 2×1068498449432 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (106849844947) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 17808307488 + ... + 17808307493.
It is an arithmetic number, because the mean of its divisors is an integer number (35616614982).
Almost surely, 2106849844943 is an apocalyptic number.
106849844943 is a deficient number, since it is larger than the sum of its proper divisors (35616614985).
106849844943 is an equidigital number, since it uses as much as digits as its factorization.
106849844943 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 35616614984.
The product of its (nonzero) digits is 23887872, while the sum is 60.
The spelling of 106849844943 in words is "one hundred six billion, eight hundred forty-nine million, eight hundred forty-four thousand, nine hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •