Base | Representation |
---|---|
bin | 101111001011010001… |
… | …1010111011001111001 |
3 | 100200111110211101010011 |
4 | 1132112203113121321 |
5 | 3124440341213423 |
6 | 114312523021521 |
7 | 10214362436164 |
oct | 1362643273171 |
9 | 320443741104 |
10 | 101310101113 |
11 | 39a68a024a1 |
12 | 1777466a8a1 |
13 | 97270732c0 |
14 | 4c91050adb |
15 | 297e272b0d |
hex | 17968d7679 |
101310101113 has 4 divisors (see below), whose sum is σ = 109103185828. Its totient is φ = 93517016400.
The previous prime is 101310101111. The next prime is 101310101119. The reversal of 101310101113 is 311101013101.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 311101013101 = 67 ⋅4643298703.
It can be written as a sum of positive squares in 2 ways, for example, as 9696734784 + 91613366329 = 98472^2 + 302677^2 .
It is a cyclic number.
It is not a de Polignac number, because 101310101113 - 21 = 101310101111 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (13), and also a Moran number because the ratio is a prime number: 7793084701 = 101310101113 / (1 + 0 + 1 + 3 + 1 + 0 + 1 + 0 + 1 + 1 + 1 + 3).
It is a junction number, because it is equal to n+sod(n) for n = 101310101093 and 101310101102.
It is not an unprimeable number, because it can be changed into a prime (101310101111) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3896542338 + ... + 3896542363.
It is an arithmetic number, because the mean of its divisors is an integer number (27275796457).
Almost surely, 2101310101113 is an apocalyptic number.
101310101113 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
101310101113 is a deficient number, since it is larger than the sum of its proper divisors (7793084715).
101310101113 is an equidigital number, since it uses as much as digits as its factorization.
101310101113 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7793084714.
The product of its (nonzero) digits is 9, while the sum is 13.
Adding to 101310101113 its reverse (311101013101), we get a palindrome (412411114214).
The spelling of 101310101113 in words is "one hundred one billion, three hundred ten million, one hundred one thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •