Base | Representation |
---|---|
bin | 101111001101100000… |
… | …0010010111000001101 |
3 | 100200200200101010222001 |
4 | 1132123000102320031 |
5 | 3130114001343423 |
6 | 114324151552301 |
7 | 10216260345445 |
oct | 1363300227015 |
9 | 320620333861 |
10 | 101384793613 |
11 | 39aa7089034 |
12 | 1779568b691 |
13 | 973969594c |
14 | 4c9ad35125 |
15 | 2985ac8cad |
hex | 179b012e0d |
101384793613 has 4 divisors (see below), whose sum is σ = 107348605020. Its totient is φ = 95420982208.
The previous prime is 101384793583. The next prime is 101384793659. The reversal of 101384793613 is 316397483101.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 93481228009 + 7903565604 = 305747^2 + 88902^2 .
It is a cyclic number.
It is not a de Polignac number, because 101384793613 - 25 = 101384793581 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101384793673) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2981905678 + ... + 2981905711.
It is an arithmetic number, because the mean of its divisors is an integer number (26837151255).
Almost surely, 2101384793613 is an apocalyptic number.
It is an amenable number.
101384793613 is a deficient number, since it is larger than the sum of its proper divisors (5963811407).
101384793613 is an equidigital number, since it uses as much as digits as its factorization.
101384793613 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5963811406.
The product of its (nonzero) digits is 326592, while the sum is 46.
The spelling of 101384793613 in words is "one hundred one billion, three hundred eighty-four million, seven hundred ninety-three thousand, six hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.099 sec. • engine limits •