Base | Representation |
---|---|
bin | 11001001001011101… |
… | …00111000001001111 |
3 | 1021211220200221120212 |
4 | 30210232213001033 |
5 | 210122240200421 |
6 | 10111411233035 |
7 | 655366312622 |
oct | 144456470117 |
9 | 37756627525 |
10 | 13501100111 |
11 | 57a9023384 |
12 | 27495a877b |
13 | 1372150745 |
14 | 921129db9 |
15 | 540435e5b |
hex | 324ba704f |
13501100111 has 2 divisors, whose sum is σ = 13501100112. Its totient is φ = 13501100110.
The previous prime is 13501100083. The next prime is 13501100113. The reversal of 13501100111 is 11100110531.
13501100111 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 13501100111 - 218 = 13500837967 is a prime.
Together with 13501100113, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13501100113) 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 as a sum of consecutive naturals, namely, 6750550055 + 6750550056.
It is an arithmetic number, because the mean of its divisors is an integer number (6750550056).
Almost surely, 213501100111 is an apocalyptic number.
13501100111 is a deficient number, since it is larger than the sum of its proper divisors (1).
13501100111 is an equidigital number, since it uses as much as digits as its factorization.
13501100111 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 15, while the sum is 14.
Adding to 13501100111 its reverse (11100110531), we get a palindrome (24601210642).
The spelling of 13501100111 in words is "thirteen billion, five hundred one million, one hundred thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •