Base | Representation |
---|---|
bin | 101111001100010010… |
… | …1000111000101110101 |
3 | 100200120211211100200011 |
4 | 1132120211013011311 |
5 | 3130023043104023 |
6 | 114320140020221 |
7 | 10215254514223 |
oct | 1363045070565 |
9 | 320524740604 |
10 | 101344113013 |
11 | 39a86123100 |
12 | 17783b31671 |
13 | 97311213a0 |
14 | 4c95785b13 |
15 | 298224050d |
hex | 1798947175 |
101344113013 has 24 divisors (see below), whose sum is σ = 119993543768. Its totient is φ = 85022784000.
The previous prime is 101344112897. The next prime is 101344113049. The reversal of 101344113013 is 310311443101.
It can be written as a sum of positive squares in 4 ways, for example, as 269714929 + 101074398084 = 16423^2 + 317922^2 .
It is not a de Polignac number, because 101344113013 - 217 = 101343981941 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 (101344113413) 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 23 ways as a sum of consecutive naturals, for example, 11889193 + ... + 11897713.
Almost surely, 2101344113013 is an apocalyptic number.
101344113013 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
101344113013 is a deficient number, since it is larger than the sum of its proper divisors (18649430755).
101344113013 is a wasteful number, since it uses less digits than its factorization.
101344113013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16117 (or 16106 counting only the distinct ones).
The product of its (nonzero) digits is 432, while the sum is 22.
Adding to 101344113013 its reverse (310311443101), we get a palindrome (411655556114).
The spelling of 101344113013 in words is "one hundred one billion, three hundred forty-four million, one hundred thirteen thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •