Base | Representation |
---|---|
bin | 101111000101011001… |
… | …1110111110000000001 |
3 | 100122222202010202012021 |
4 | 1132022303313300001 |
5 | 3124034423220223 |
6 | 114241204401441 |
7 | 10206451115560 |
oct | 1361263676001 |
9 | 318882122167 |
10 | 101113101313 |
11 | 39977789644 |
12 | 1771a6a6281 |
13 | 96c52c9783 |
14 | 4c72c0dbd7 |
15 | 296bd0c65d |
hex | 178acf7c01 |
101113101313 has 8 divisors (see below), whose sum is σ = 122355349632. Its totient is φ = 81570232896.
The previous prime is 101113101311. The next prime is 101113101373. The reversal of 101113101313 is 313101311101.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 101113101313 - 21 = 101113101311 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (101113101311) 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, 424844845 + ... + 424845082.
It is an arithmetic number, because the mean of its divisors is an integer number (15294418704).
Almost surely, 2101113101313 is an apocalyptic number.
It is an amenable number.
101113101313 is a deficient number, since it is larger than the sum of its proper divisors (21242248319).
101113101313 is an equidigital number, since it uses as much as digits as its factorization.
101113101313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 849689951.
The product of its (nonzero) digits is 27, while the sum is 16.
Adding to 101113101313 its reverse (313101311101), we get a palindrome (414214412414).
The spelling of 101113101313 in words is "one hundred one billion, one hundred thirteen million, one hundred one thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •