Base | Representation |
---|---|
bin | 11000011001101011… |
… | …01011101011010011 |
3 | 1020210222112020120202 |
4 | 30030311223223103 |
5 | 203312134113021 |
6 | 10003532525415 |
7 | 642431502260 |
oct | 141465535323 |
9 | 36728466522 |
10 | 13100301011 |
11 | 5612862056 |
12 | 265732086b |
13 | 130a0bc505 |
14 | 8c3bd8267 |
15 | 51a165a0b |
hex | 30cd6bad3 |
13100301011 has 4 divisors (see below), whose sum is σ = 14971772592. Its totient is φ = 11228829432.
The previous prime is 13100300999. The next prime is 13100301037. The reversal of 13100301011 is 11010300131.
It is a happy number.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 11010300131 = 233 ⋅47254507.
It is a cyclic number.
It is not a de Polignac number, because 13100301011 - 26 = 13100300947 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 13100300983 and 13100301001.
It is not an unprimeable number, because it can be changed into a prime (13100301311) 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 3 ways as a sum of consecutive naturals, for example, 935735780 + ... + 935735793.
It is an arithmetic number, because the mean of its divisors is an integer number (3742943148).
Almost surely, 213100301011 is an apocalyptic number.
13100301011 is a deficient number, since it is larger than the sum of its proper divisors (1871471581).
13100301011 is an equidigital number, since it uses as much as digits as its factorization.
13100301011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1871471580.
The product of its (nonzero) digits is 9, while the sum is 11.
Adding to 13100301011 its reverse (11010300131), we get a palindrome (24110601142).
The spelling of 13100301011 in words is "thirteen billion, one hundred million, three hundred one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.184 sec. • engine limits •