Base | Representation |
---|---|

bin | 11101011001010001011… |

… | …00001111011111110011 |

3 | 10120112222122012002222212 |

4 | 32230220230033133303 |

5 | 113021440000013021 |

6 | 2051553153122335 |

7 | 132653512233641 |

oct | 16545054173763 |

9 | 3515878162885 |

10 | 1010000001011 |

11 | 35a37a740741 |

12 | 1438b2b593ab |

13 | 7431cc865c1 |

14 | 36c545aa191 |

15 | 1b41462485b |

hex | eb28b0f7f3 |

1010000001011 has 4 divisors (see below), whose sum is σ = 1015233161832. Its totient is φ = 1004766840192.

The previous prime is 1010000001001. The next prime is 1010000001071. The reversal of 1010000001011 is 1101000000101.

It is a semiprime because it is the product of two primes.

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2^{k}-1010000001011 is a prime.

It is a Duffinian number.

It is a junction number, because it is equal to *n*+sod(*n*) for *n* = 1010000000986 and 1010000001004.

It is not an unprimeable number, because it can be changed into a prime (1010000001001) 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, 2616580121 + ... + 2616580506.

It is an arithmetic number, because the mean of its divisors is an integer number (253808290458).

Almost surely, 2^{1010000001011} is an apocalyptic number.

1010000001011 is a deficient number, since it is larger than the sum of its proper divisors (5233160821).

1010000001011 is an equidigital number, since it uses as much as digits as its factorization.

1010000001011 is an evil number, because the sum of its binary digits is even.

The sum of its prime factors is 5233160820.

The product of its (nonzero) digits is 1, while the sum is 5.

Adding to 1010000001011 its reverse (1101000000101), we get a palindrome (2111000001112).

The spelling of 1010000001011 in words is "one trillion, ten billion, one thousand, eleven".

• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.106 sec. • engine limits •