Base | Representation |
---|---|
bin | 110001110010001001… |
… | …1100000111111110001 |
3 | 101012221201011011002101 |
4 | 1203210103200333301 |
5 | 3222422320124431 |
6 | 121040310220401 |
7 | 10503214031014 |
oct | 1434423407761 |
9 | 335851134071 |
10 | 106909536241 |
11 | 41381711a32 |
12 | 18877954701 |
13 | a10a160621 |
14 | 526298d37b |
15 | 2baab34961 |
hex | 18e44e0ff1 |
106909536241 has 8 divisors (see below), whose sum is σ = 107523914400. Its totient is φ = 106295348640.
The previous prime is 106909536221. The next prime is 106909536269. The reversal of 106909536241 is 142635909601.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-106909536241 is a prime.
It is a super-2 number, since 2×1069095362412 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 106909536191 and 106909536200.
It is not an unprimeable number, because it can be changed into a prime (106909536221) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1166050 + ... + 1254388.
It is an arithmetic number, because the mean of its divisors is an integer number (13440489300).
Almost surely, 2106909536241 is an apocalyptic number.
It is an amenable number.
106909536241 is a deficient number, since it is larger than the sum of its proper divisors (614378159).
106909536241 is an equidigital number, since it uses as much as digits as its factorization.
106909536241 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 95279.
The product of its (nonzero) digits is 349920, while the sum is 46.
The spelling of 106909536241 in words is "one hundred six billion, nine hundred nine million, five hundred thirty-six thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •