Base | Representation |
---|---|
bin | 101111011011001100… |
… | …1101001111110111101 |
3 | 100201212201020221000011 |
4 | 1132312121221332331 |
5 | 3132034133123220 |
6 | 114441531303221 |
7 | 10233541225531 |
oct | 1366631517675 |
9 | 321781227004 |
10 | 101844426685 |
11 | 3a212584181 |
12 | 178a35aab11 |
13 | 97b0986191 |
14 | 4d01dbdbc1 |
15 | 29b111b65a |
hex | 17b6669fbd |
101844426685 has 4 divisors (see below), whose sum is σ = 122213312028. Its totient is φ = 81475541344.
The previous prime is 101844426679. The next prime is 101844426703. The reversal of 101844426685 is 586624448101.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 586624448101 = 23 ⋅25505410787.
It can be written as a sum of positive squares in 2 ways, for example, as 58718013124 + 43126413561 = 242318^2 + 207669^2 .
It is a cyclic number.
It is not a de Polignac number, because 101844426685 - 25 = 101844426653 is a prime.
It is a Duffinian number.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 10184442664 + ... + 10184442673.
It is an arithmetic number, because the mean of its divisors is an integer number (30553328007).
Almost surely, 2101844426685 is an apocalyptic number.
It is an amenable number.
101844426685 is a deficient number, since it is larger than the sum of its proper divisors (20368885343).
101844426685 is an equidigital number, since it uses as much as digits as its factorization.
101844426685 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20368885342.
The product of its (nonzero) digits is 1474560, while the sum is 49.
It can be divided in two parts, 101844 and 426685, that added together give a square (528529 = 7272).
The spelling of 101844426685 in words is "one hundred one billion, eight hundred forty-four million, four hundred twenty-six thousand, six hundred eighty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •