Base | Representation |
---|---|
bin | 110001101101001110… |
… | …0000111101001000111 |
3 | 101012112011201000211201 |
4 | 1203122130013221013 |
5 | 3222102432111102 |
6 | 121012034443331 |
7 | 10466134124005 |
oct | 1433234075107 |
9 | 335464630751 |
10 | 106744019527 |
11 | 412a7241862 |
12 | 18830433547 |
13 | a0b1a8ab42 |
14 | 52489c5a75 |
15 | 2b9b33c987 |
hex | 18da707a47 |
106744019527 has 4 divisors (see below), whose sum is σ = 106898497816. Its totient is φ = 106589541240.
The previous prime is 106744019519. The next prime is 106744019597. The reversal of 106744019527 is 725910447601.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 725910447601 = 157999 ⋅4594399.
It is a cyclic number.
It is not a de Polignac number, because 106744019527 - 23 = 106744019519 is a prime.
It is a super-2 number, since 2×1067440195272 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (106744019597) 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 3 ways as a sum of consecutive naturals, for example, 77238108 + ... + 77239489.
It is an arithmetic number, because the mean of its divisors is an integer number (26724624454).
Almost surely, 2106744019527 is an apocalyptic number.
106744019527 is a deficient number, since it is larger than the sum of its proper divisors (154478289).
106744019527 is an equidigital number, since it uses as much as digits as its factorization.
106744019527 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 154478288.
The product of its (nonzero) digits is 423360, while the sum is 46.
The spelling of 106744019527 in words is "one hundred six billion, seven hundred forty-four million, nineteen thousand, five hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •